I'm starting heavy plyouts, with variable move selection weights. The proximity heuristic seems like a performance killer since most weights would require an update with each move.

How do others handle this? Is proximity reserved for the search tree?

How do others store data for rapid lookup?

Sent from my iPhone
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to