Towers of Hanoi
- The Towers of Hanoi is a more complex problem involving three
towers and a series of differently sized disks.
- We've developed a rule based system that works for variable numbers
of disks.
- We use a stack to solve the problem.
- In particular, you can see how the disks move with three disks.
- The largest bottom disk starts on tower 1 and moves to tower 3
at around 600 ms. (Note that all the times here are simulated
times, though on SpiNNaker they're real time from start of execution.)
- The internal facts (above neuron 590) are used for combining the
expression in a rule that has more than two conjuncts.
