User blog:Ynought/My "C function"

So you have a squence of instructions \((S_1,S_2...,S_n\)

and you have a graph like the one from calculus and you have two players \(P1\) and \(P2\)

from then apply these rules to the graph:

1.\(P1\) starts at (0|0) and moves to (0±k|0±k)

2.\(P2\) can ban any coodinate i.e (7|3) then \(P1\) can't move to that coordinate

3.\(P1\) moves from his previous position (a|b) to (a±k|b±k)

4.repeat rules 2 and 3 until \(P1\) can't move anywhere

If \(P1\) can always move then \(P2\) can ban the least amount of squares such that the sequence terminates

Then \(C(k)=n\) where \(n\) is the number of instructions in the longest set of instructions createable with the rules above