User blog:Ynought/SGF (Square graph function)

at every intersection of the lines in a square you can place a point of \(n\) possible colors (spaced 1 unit apart)

(the square has side lenght \(n\) )

at the first step you have to place at least 2 points in the square

then take every point in the square and colors the lines in the corosponding color

could look like :

if there are two dots next two each other this happen:

so from then on you take the square (already with the lines colored) and place the dots again.But you can't place dots with one color to lines with that same color.After you place the dots (after the first time)you can remove a color. then SGF(\(n\)) is the longest game with \(n\) colours and side lenght \(n\)

Then /text{SGF}_2(n) is the exact same as SGF but in n dimension if n is above 2 other wise /text{SGF}_2(n) = SGF(\(n\))