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.

• Type: Journal
• Year: 2015
• Where: ACG
• Authors: Cameron Browne
• Keywords: ACG 2015, Computer Graphics