13 citations · 15 across the 2 of their papers we have counts for
1 paper · 1 filter
Jos Uiterwijk
When solving k-in-a-Row games, the Hales-Jewett pairing strategy [4] is a well-known strategy to prove that specific positions are (at most) a draw. It requires two empty squares p…