Tiny robot simulate, it's available to run on tryfs.net (but not on iPad).
3 people like thisPosted: 12 years ago by a_a
Plays the perfect game of Tic-Tac-Toe using the Negamax algorithm.
2 people like thisPosted: 10 years ago by Richard Dalton
Generating a state space tree to the Missionaries and Cannibals Problem (http://en.wikipedia.org/wiki/Missionaries_and_cannibals_problem). Then, this tree is iterated with depth-first approach, printing all the visitations. The solutions to problem have a depth equals 9.
13 people like thisPosted: 10 years ago by Fabio Galuppo
Backtracking search for Constraint Satisfaction Problems (CSP)
4 people like thisPosted: 10 years ago by Fabio Galuppo