using a deque instead of a list for a more performant data structure
Merge pull request #32 from jstnlef/fifo-fix

using a deque instead of a list as a more performant data structure
Heuristic and value are cached on the nodes, avoiding re-calculations
Initial state should be in the repeated nodes memory
Genetic search being imported to be present on simpleai.search package
Hill_climbing_random_restarts search being imported to be present on simpleai.search package
Added A* sample
Fixed the differences on weight between cost and heuristic on the game_walk sample
Updated Machinalis mention, to include links to related projects
Updated version
Merge branch 'develop'