Petr Baudis: <[email protected]>:
>On Wed, Jun 08, 2011 at 05:26:31PM +0900, Hideki Kato wrote:
>> 
>> Kahn Jonas: <[email protected]>:
>> >> Since the game tree of Go is finite (with positional superko), unlimited
>> >> memory could be not necessary.
>> >
>> >OK, state-space-sized memory. But fixed real-sized memory is not enough.
>> 
>> So the question is, assuming memory is enough, or at a position (perhaps 
>> near the end) in practice, does node-pruning harm the convergence?
>
>I guess if you have enough memory for O(the state space), pruning just
>should not trigger?

The assumption is just to make the problem simple.

Hideki


>                               Petr "Pasky" Baudis
>_______________________________________________
>Computer-go mailing list
>[email protected]
>http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
-- 
Hideki Kato <mailto:[email protected]>
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go

Reply via email to