An exploration of word manipulation through a single button interface.

The Towers of Hanoi is an ancient puzzle played with three stacks and any number of differently-sized disks. At the start, all the disks are in the leftmost stack, with the largest disk on the bottom and the smallest on the top. The object is to get all the disks over to the rightmost stack. You can only move one disk per move, and you can only move the top disk on a stack. The top disk of any stack can be moved to the top disk of any other stack, with the restriction that you can't move a larger disk on top of a smaller disk i.e., disks can only be moved to empty stacks or on top of larger disks. minimum number of movement for the disk is by using the mathematical formula 2n-1.where N is the number of disk in stack.

It is just another battleship but its a very simple version of it, but the AI can beat human easily. This version not allow you to place the ship next to another. Place the ships on the bottom grid , then start clicking on the top grid to select a square.

This nutty professor Timexidus has made a time machine and traveled back in time... He lost a part of the time machine, and you have to help him find it back. There many puzzle to solve, before the professor can finally reach the time machine. ------------------------------------------------------- Professor Timexidus ha creato una macchina del tempo con la quale viaggiare in tutte le epoche. Purtroppo ha perduto alcune dei pezzi di questa sua creazione e ha incaricato voi di cercarli. Utilizza le frecce per muoverti e la barra spazio per saltare. Puoi raccogliere gli oggetti utilizzando la freccia in alto.

It is a time bound game where one need to find 1 difference between two identical looking boards. After each finding both board will refresh to generate a new difference. Find maximum differences within allowed time to get more points.