using a deque instead of a list for a more performant data structure
Updated hello_world sample with the docs changes
Up version, for hotfix 0.5.7
renamed Fifolist to Queue and added a Stack object for simplicity
fixing Queue unit tests
first stab at adversarial search algos
starting to implement the TicTacToe example
Added requirements file
Updated version on setup.py
Fig52Game works
added argmax and argmin util functions and accompaning tests
alpha-beta algorithm implemented along with a Tic Tac Toe sample using it.
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