Skip to content

Grid-based AI searching and game-playing algorithms.

Notifications You must be signed in to change notification settings

jaaaaaaaaack/grid

Repository files navigation

grid

Grid-based AI searching and game-playing in Petit Chez Scheme

  • branch-and-bound: a robot searches a grid for the goal using backtrack-enabled hillclimbing;
  • firstorderlogic: a robot finds a goal in a small grid using first-order reasoning;
  • hillclimber: A robot pathfinds towards a goal using only local information;
  • predator-prey: An obstacle-destroying predator robot seeks its obstacle-creating prey;
  • productionsystem: A robot uses semantic reasoning to find the goal;
  • propsearch: A robot uses propositional logic to reason its way towards the goal;
  • README.md: You are here;
  • realtime-astar: A robot uses real-time A* search to make its way towards the goal.

About

Grid-based AI searching and game-playing algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages