Application-Dependent Techniques II
Turn one enhancement off:

Technique disabled # Solved
Lower Bound 0 (-53)
Goal Macros 21 (-32)
Pattern Search 32 (-21)
Transposition Table 35 (-18)
Relevance Cuts 49 (-4)
Overestimation 50 (-3)
Tunnel Macros 51 (-2)
Move Ordering 52 (-1)
Deadlock Tables 52 (-1)
Goal Cuts 53 (-0)

Search is involved in the three most valuable features!

  • 20M nodes effort limit.
  • 90 problem test suite.
GPW'99, October 16, 1999. Pushing the Limits: New Developments in Single-Agent Search previous up next