You can insert an integer (2-10) and press enter, to edit the rowsize of dots.
min/max buttons, tryes 50 random models and save the min/max of these, and display the result

The draw a square game, where each must make a line in turn.
When one makes a square the player must make a new line.
If no more lines can be placed, the player with most squares wins.

This is just visually showing how many lines can be made (randomly) until
the next player must place a line which gives the opponent the possibility to make a square.
[X] The force a bad move point for the player. 

Dots are placed squared, n is the size of dots horizontally.

	[A]    n^2         = Num of dots
	[B]    2*n*(n-1)   = Num of lines available to be placed
	[C]    (n-1)^2     = Num of min lines available to be placed before status [X] is reached
	[D]    [B]-[C]     = Num of max lines that can be taken (theorytically) until the status [X] is reached
	[E]    (n-1)^2 * 2 = Num of max lines available to be placed before status [X] is reached
	[F]    [B]-[E]     = Num of min lines that can be taken (theorytically) until the status [X] is reached

The calculation of [C] is based on the num of squares that can be made: (n-1)^2, and if the opponent can
make succeeding squares by each new line, then the status before this point must be (n-1)^2. 
(The last line placed makes two squares)

The calculatio of [E] is needing two lines for any square to be made which is (n-1)^2 * 2.

The calc of [C] and [E] are boundaryvalues. For size bigger than 3, the found taken_min >= [F] and the found taken_max <= [D]
This can be seen if you choose the size as 3 and press min and max button a couple of times in the java applet above. 

     MAX taken: 2*n*(n-1) - (n-1)^2
     MIN taken: 2*n*(n-1) - 2*(n-1)^2

     n=3
     MAX taken: 2*3*(3-1) - (3-1)^2   = 8
     MIN taken: 2*3*(3-1) - 2*(3-1)^2 = 4