A* search

A general way of doing A*, applied to towers of hanoi. As described by Peter Norvig.

Animating

You can run an animated version of the shortest path in your terminal:

hanoi 3 5

The first argument is the number of disks, the second the number of pegs.

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
.gitignore		.gitignore
.travis.yml		.travis.yml
Gemfile		Gemfile
Gemfile.lock		Gemfile.lock
README.md		README.md
Rakefile		Rakefile
hanoi		hanoi
node.rb		node.rb
problem.rb		problem.rb
render.rb		render.rb
search.rb		search.rb
test.rb		test.rb