Project for Artificial Intelligence labs
Go to file
2021-06-10 21:23:58 +02:00
core Add decision trees and some refactor 2021-06-10 21:23:58 +02:00
__init__.py first commit 2021-03-15 01:02:13 +01:00
.gitignore Add decision trees and some refactor 2021-06-10 21:23:58 +02:00
main.py Add decision trees and some refactor 2021-06-10 21:23:58 +02:00
README.txt Add decision trees and some refactor 2021-06-10 21:23:58 +02:00
requirements.txt Add decision trees and some refactor 2021-06-10 21:23:58 +02:00

required pygame library installed
change img directory in main.py line 13

board is represented as 2D lists of square objects, where first index of the list points to the row and second to the column
of the square(piece object) location

each square(piece object) contains own x and y identifiers and isSbThere atribute which stores info if detective is standing on 
piece location

a_star algorithm:
-goal: nearest mushroom without posion, x,y finded by bfs
-get_cost: return summary cost of parent node and cost of current node (predictable heuristic cost and cost of field)
-heuristic function: summary of differences between node location and goal location