Object: Tile large squares with smaller squares (such that no two square tiles have a side in common).
(2 variants, 100 solutions)

There are two way to draw squares:
1. 'Speed Draw': Click the board to specify the position of the bottom right corner of a square only. The program will automatically draw the largest square possible that can be fitted.
2. '2-Point Draw': To place a square click the board for the top left corner, then for the bottom right corner.
You can switch between the two modes at any time. The largest available tile is a square of size 30x30.

You can hit the FRAME button and then click the main board to draw a frame for a rectangle to be filled.
Hit the one of the four ARROW buttons to shift the whole tiling.

DEFAULT VARIANT:
The goal is to completely tile a large square area with smaller squares such that no two tiles may not have a side in common ('nowhere-neat tiling').
The following sizes of squares smaller than 50x50 have been solved under this condition:
11x11, 16x16, 18x18, 19x19, 20x20 and all nxn, where n > 21.
All known solutions have been added.

The system will add 1x1 squares automatically if an empty position has three occupied neighbors!
If you do not want this, click the 'Autofill 1x1' button to switch it off.
To delete an existing square click it anywhere.

A special solution display tool has been added (click the SOLUTIONS button or view a subset of solutions by clicking one of the buttons at the bottom border).
If possible, solutions should be fault-free (no breaking line) and should not be enlargements of other solutions.

FREEPLAY VARIANT:
Here are no restrictions; two squares may have a side in common.

There is no win-message in this game.

Please note that there are 25 alternative board/piece set combinations available (hit 'change piece sets' button).
The default piece set shows the size of each square tile at its lower left and right corners.

The idea for these puzzles is taken from my books 'NUTTS And Other Crackers' and 'New Mosaics' (see my home pages).
The special property of the tilings of no two tiles having a side in common is called 'nowhere-neat'.
The author Karl Scherer showed that there is a solution for each R(n, m) with n > 1187 and m > 464. The Mathematical proof for this theorem is attached.

Some of the solutions presented here appeared first on the website http://www.squaring.net under the related and more restrictive topic of 'perfect' and 'imperfect' tilings.

Associated Zillions games: 'Square The Square', 'Square The Rectangle'.