Change search
ReferencesLink to record
Permanent link

Direct link
Genetic algorithms in mazes: A comparative study of the performance for solving mazes between genetic algorithms, BFS and DFS.
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Genetiska algoritmer i labyrinter : En jämförande studie av prestandan för lösande av labyrinter mellan genetiska algoritmer, BFS och DFS. (Swedish)
Abstract [en]

In this report, genetic algorithms were compared to BFS and DFS for solvingmazes with regards to computational time and solution path length. This wasdone by creating mazes with Wilson's algorithm and running several tests ina controlled environment. The solution path length found by the genetic algorithmwas in general better than the DFS and often almost as good as the onefound by the BFS. The computational time needed by the genetic algorithmhowever was signicantly worse than the time needed by both the DFS and theBFS.

Abstract [sv]

I denna rapport har genetiska algoritmer jamforts med BFS och DFS for attlosa labyrinter med avseende pa berakningstid och losningslangd. Detta gjordesgenom att skapa labyrinter med Wilsons algoritm och kora en stor mangd testeri en kontrollerad miljo. Losningslangderna som den genetiska algoritmen fannvar i allmanhet battre an de av DFS och ofta nastan lika bra som de som BFSfann. Den genetiska algoritmens berakningstid var dock betydligt langre an dentid som kravdes for bade DFS och BFS.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-186448OAI: diva2:927325
Educational program
Master of Science in Engineering - Computer Science and Technology
Available from: 2016-05-12 Created: 2016-05-11 Last updated: 2016-05-12Bibliographically approved

Open Access in DiVA

fulltext(1033 kB)60 downloads
File information
File name FULLTEXT01.pdfFile size 1033 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 60 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 49 hits
ReferencesLink to record
Permanent link

Direct link