This game was created as a result of the university's course "The Fundamentals of Artificial Intelligence" task.
The AI algorithm includes itself alpha-beta pruning and two heuristic functions:
() one that calculates the difference between each player score,
() the second one checks if the last child has no childs. If the depth of last child is equal to foresight count of AI, it returns 0 (because at this point the last child will always have no childs). If score difference is more than 0, 9999 is returned, otherwise -9999 is returned. After that this score is divided by depth level. This means the algorithm will prioritize the paths where game can be ended as soon as possible
The AI implementation you can find in IngameAI files.
-
Notifications
You must be signed in to change notification settings - Fork 0
License
AndrisRTU/Digital-Wars
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published