13 citations · 15 across the 2 of their papers we have counts for
3 papers
math.CO2017★ 2 cited
Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy
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…
cs.AI2016
11 x 11 Domineering is Solved: The first player wins
Jos W. H. M. Uiterwijk
We have developed a program called MUDoS (Maastricht University Domineering Solver) that solves Domineering positions in a very efficient way. This enables the solution of known po…
cs.AI2015★ 13 cited
New Results for Domineering from Combinatorial Game Theory Endgame Databases
Jos Uiterwijk, Michael Barton
We have constructed endgame databases for all single-component positions up to 15 squares for Domineering, filled with exact Combinatorial Game Theory (CGT) values in canonical for…