Parallel Execution of Backtrack Search with optimizations



AbstractThis project covers the implementation of a parallelized version of the generic backtrack search algorithm and it is used to find all or just a single solution to the N-Queen problem. Furthermore, various new heuristics and optimizations are explored. All implementations are tested and the results are posted and discussed. The project also explores how the .NET Framework may aid in the design on parallelized programs.
TypeBachelor thesis [Academic thesis]
Year2011
PublisherTechnical University of Denmark, DTU Informatics, E-mail: reception@imm.dtu.dk
AddressAsmussens Alle, Building 305, DK-2800 Kgs. Lyngby, Denmark
SeriesIMM-B.Sc.-2011-15
NoteSupervised by Associate Professor Michael Reichhardt-Hansen, mrh@imm.dtu.dk, DTU Informatics
Electronic version(s)[pdf]
Publication linkhttp://www.imm.dtu.dk/English.aspx
BibTeX data [bibtex]
IMM Group(s)Computer Science & Engineering