: involving or serving as an aid to learning, discovery, or problem-solving by experimental and especially trial-and-error methods <heuristic techniques> heuristic assumption>;
also : of or relating to exploratory problem-solving techniques that utilize self-educating techniques (as the evaluation of feedback) to improve performance
PathDemo.zip - a program demonstrating
various heuritic pathfinding alghrithms. Described in article above.
Here you can examine what happens when you play a game
against a smart adversary.
Follow the instructions for the
game in and try to maximize your score.
In
Exercise you will be able
to see how an algorithm works to figure out the maximum score possible.
This algorithm is used in game theory to determine a good strategy to
perform. This kind of algorithm can be used to allow the computer to play
tic-tac-toe and chess.
Taken from Kalamazoo College class
CS400
Pathfinding games - Description how the A* search (pathfinding) algorithm has been used in several games
See also a large set of pages on AI and Games,
with many pointers to texts, software, etc.
