Contains a selection of the following algorithms:

• Uniform Cost
• Depth First Search
• Breath First Search
• A* (Breath First Search with a heuristic approach)

Example of problems to test:

• Missionaires and Cannibals
• Nickel and Dime (To move a pair of coins from one side to another...)
• Buckets(i.e. Two buckets of water. One with 5 liters and another with 3. How do i measure 4 liters. I can only move, fill them up or empty them..)
• Eight Puzzle
• Specific graph path problem (Graph represented by multi array of nodes. Find the best path to reach a specific node)