Pattern Search - I
  • Dynamically detect deadlocks and "penalties".
  • Save the patterns of such interacting stones.
  • Reuse that pattern knowledge throughout the tree.
  • Improve the lower bound for positions,
    either by assigning INFINITY (deadlock) or improving the lower bound.
Example deadlock:

GPW'99, October 16, 1999. Pushing the Limits: New Developments in Single-Agent Search previous up next