The Tower of Hanoi is a puzzle with three rods side by side and rings which fit onto the rods. The rings start on a single rod with the largest at the bottom decreasing in size as you go up, and the goal is to move them to the complete opposite rod following a few rules: 

1. Only one disk may be moved at a time

2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod

3. No disk may be placed on top of a disk that’s smaller than it

This version has 8 rings meaning it can be solved most efficiently in 255 moves. Good luck.