User blog comment:Wythagoras/Finite Promise Games/@comment-10429372-20140829185955/@comment-10429372-20140830065338

There seems to be a problem. The current definition says:


 * Let FPCI(a) be the minimal N such that Wojtek can win GN(P,Q,n,N).

Since the numbers that can be selected are between -N and N, it has no effect that he has to accept all double factorial numbers larger than N. Therefore, FPCI(n) = 1 for every n.