Snippets created by Fabio Galuppo

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.