COMP4106: Exploring different search methods in order for a cat to catch a mouse before the mouse eats all the cheese. Cat moves in equivalent way to knight in chess. Mouse moves 1 unit at a time. Breadth first search, Depth first search, A* search and hueristic search used
-
Notifications
You must be signed in to change notification settings - Fork 0
bobyms/AICatMouseGame
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
COMP4106: Exploring different search methods in order for a cat to catch a mouse before the mouse eats all the cheese
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published