Tower Of Hanoi

This game requires mouse and cannot be played on mobile except Auto Solve option.

The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Brahma) is a mathematical game or puzzle.

It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly stacked in order of size on one rod, the smallest at the top, thus making a conical shape.

Rules

The objective of the puzzle is to move the entire stack in the first rod to the third rod, obeying the following rules:

Only one disk may be moved at a time.
Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
No disk may be placed on top of a smaller disk.

N Queens Problem

N Queens problem is a game where we have to place N queens on an N*N board such that no queen hits others on its move. A queen can move as far as she pleases, horizontally, vertically, or diagonally. Even numbered grids are difficult to solve than odd numbered grids. So do not forget to try them out.