Object: Fill the 9x12 playing area with G-hexominoes.
If a shape tiles a rectangle, then this rectangle is called a 'prime rectangle' or a 'prime' for short, if it is minimal in the sense that it cannot be cut into smaller rectangles which also can be tiled by the given shape. Hence for each shape that is 'rectifiable' (i.e. which can tile a rectangle), it is an interesting task to find all prime rectangles ('primes') for this tile. For any given tile there can only be a finite number of such rectangles. For the G-hexomino we present here all known prime rectangles small enough to fit onto our board of size 32x32. The G-hexomino is represented by six square tokens. The system will automatically change the colour of the tokens after you have put down a tile. The system helps you to place a tile: Place two squares side by side, then a third orthogonally next to the second. The system will drop the remaining two squares automatically. You can DELETE a placed hexomino by simply clicking the three squares which you placed on the board when you created the tile. You win if you manage to fill the given rectangle. This game presents the COMPLETE COLLECTION of all existing G-primes: 18 of those fit on the 32x32 board and 8 of those fit on the 52x50 board. Please note that there are six alternative piece sets available. Sources: Torsten Sillke, Michael Reid. See also the Zillions games 'Y-Primes', 'Pento', 'Ypento', 'Reptiles' and 'Reptiles II' for related puzzles. Background design : fractal T011001l by Karl Scherer. More freeware as well as real puzzles and games at my homepage http://karl.kiwi.gen.nz. |