Part of the problem is that we're using global search to play a game with lots of local little fights. If we have say five little fights, and each takes say 11 ply to play well, it means a >50 ply global search just to avoid local blunders.

Currently, we try to sidestep this fundamental problem by replacing local search with local knowledge, such as patterns. But that does not fully use the power of search.

        Martin
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to