User blog:Ynought/H function (once again graph related)

Start of with a dot in a \(n\) by \(n\) square.Place a player in the most ideal spot and color him in one of \(n\) colors  .Then take that dot and apply the following rules :
 * 1) Replace the dot with a line with dots at the end rotated in the ideal way(the way with the longest string of rules)​​​​​​
 * 2) Color one of the dots at the end of a line with one of \(n\) colors(if all the dots are colored uncolor one)
 * 3) Replace the non colored dot with a line with dots at the end rotated in the ideal way(the way with the longest string of rules) and color the resulting line with one of \(n\) colors
 * 4) Move the player left,right,up or down
 * 5) remove a single line/dot 
 * 6) repeat rules 2-5 until  the player is surrounded by lines of the same color​​​​​​​​​​​​​​