On Wed, Jun 17, 2009 at 8:37 PM, Mark Boon <tesujisoftw...@gmail.com> wrote:
> On Wed, Jun 17, 2009 at 9:17 AM, David Fotland<fotl...@smart-games.com> > wrote: > > Many Faces uses position value collection. Positions are hashed and > looked > > up in the position table (with a hash invariant to rotations and > > reflections). Each node has information about the position (wins, > losses, > > strongest players at this position, etc). It's easy enough to do a 1 ply > > search to get position -> move values. It's easy to fill the table with > > professional positions to get a pro game collection. It's easy to map a > > game tree to the table. So I think this is the most general solution. > > > > Earlier versions used a game tree since that is much easier to code. I > > switched to the position/value collection in version 12. > > > > In my old Goliath program I used positions as hashcodes to lookup a > move/value combination because it was much easier to program than > trees :) I think this is the better solution and it's probably easier too. > > > I don't know if it's the best solution, but it worked and it was easy > to program. > > Mark > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
