Theses (IK)

Állandó link (URI) ehhez a gyűjteményhez

https://hdl.handle.net/2437/251433

Böngészés

Theses (IK) Tárgyszó szerinti böngészés "A* Heuristics"

Megjelenítve 1 - 1 (Összesen 1)
  • Nincs kép
    TételKorlátozottan hozzáférhető
    Flood Fill Puzzle & Artificial Intelligence
    Kazybaev, Emir; Aszalós, László; DE--Informatikai Kar
    Flood 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.