Sciweavers

ACG
2015
Springer

Boundary Matching for Interactive Sprouts

8 years 24 days ago
Boundary Matching for Interactive Sprouts
The simplicity of the pen-and-paper game Sprouts hides a surprising combinatorial complexity. We describe an optimisation called boundary matching that accommodates this complexity to allow move generation for Sprouts games of arbitrary size at interactive speeds.
Cameron Browne
Added 28 Mar 2016
Updated 28 Mar 2016
Type Journal
Year 2015
Where ACG
Authors Cameron Browne
Comments (0)