Flood Fill Puzzle & Artificial Intelligence

A tétel rövid nézete
dc.contributor.advisorAszalós, László
dc.contributor.authorKazybaev, Emir
dc.contributor.departmentDE--Informatikai Karhu_HU
dc.date.accessioned2021-05-04T10:44:04Z
dc.date.available2021-05-04T10:44:04Z
dc.date.created2021-05-03
dc.description.abstractFlood Puzzle is a combinatorial game for one player, based on the color-filling algorithm. Each cell of the board has an initial color from the previously determined color set and the goal is to fill the grid into monotone color within allowed moves. Based on game four Artificial Intelligence search methods were implemented in Python order to find a best way of obtaining the solution for the puzzle. Statistics on those four methods namely Breadth-First Search, A* Search, Depth Elimination Search and Optimized Breadth-First Search was collected and compared to find out what is the best search method to get an optimal solution regarding the outcome of moves, time and number of explored nodes.hu_HU
dc.description.courseComputer Sciencehu_HU
dc.description.degreeBSc/BAhu_HU
dc.format.extent42hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/308334
dc.language.isoenhu_HU
dc.subjectArtificial Intelligencehu_HU
dc.subjectPythonhu_HU
dc.subjectOOPhu_HU
dc.subjectA* Searchhu_HU
dc.subjectBreadth-First Searchhu_HU
dc.subjectPuzzlehu_HU
dc.subjectFill Algorithmhu_HU
dc.subjectFlood Puzzlehu_HU
dc.subjectFlood-fill Algorithmhu_HU
dc.subjectA* Heuristicshu_HU
dc.subject.dspaceDEENK Témalista::Informatikahu_HU
dc.titleFlood Fill Puzzle & Artificial Intelligencehu_HU
Fájlok
Gyűjtemények
Theses (IK)