Metarules to improve tactical Go knowledge
Three main problems arise with automatically generated rules databases. They can be too large to fit in memory, they can take a lot of time to generate, and it can take time to match many generated rules on a board. I propose to use exceptions and metarules to reduce the size of the databases. The reduction in size enables larger rules to be used, at the cost of small overheads in generation and matching times. However, the reduction in search depth provided by the new larger rules decreases the overall search time of a tsumego problem solver.
search game of go retrograde analysis metaknowledge pattern databases