2009/10/30 terry mcintyre <terrymcint...@yahoo.com>: > This may be useful in computer Go. One of the reasons human pros do well is > that they compute certain sub-problems once, and don't repeat the effort > until something important changes. They know in an instant that certain > positions are live or dead or seki; they know when a move ( reducing a > liberty, for example ) disturbs that result. This could probably be emulated > with theorem-proving ability. Presently, search algorithms have to > rediscover these results many times over; this is (in my opinion) why > computer programs get significantly weaker when starved for time; they > cannot think deeply enough to solve problems which may be solved in an > eyeblink by a pro.
This sounds a lot like a description of GNU Go's persistent reading cache, which calculates "reading shadow" for all its readings. Has something similar tried for other programs? -- Seo Sanghyeon _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
