On Thu, Jun 18, 2009 at 10:20 AM, Brian Sheppard wrote:
> >> 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.
>
> You prob
On Wed, Jun 17, 2009 at 8:37 PM, Mark Boon wrote:
> On Wed, Jun 17, 2009 at 9:17 AM, David Fotland
> 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 infor
On Wed, Jun 17, 2009 at 9:17 AM, David Fotland 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
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
> 1 a position -> move collection (if the position is such make that move)
> 2 a position value collection (this position is good, that position is
> bad for the colur who is on the move)
> 3 a professional game collection (let the program just play like the
> pro's)
> 4 a game tree (game with lo
(I just forgot to mention that we take care of rotations / symetries)
I was puzzeling what is the best way to organise an opening book?
>>
>
> Our solution was the following. We have two possible structures:
> 1) a big set of SGF games;
> 2) an opening book in which one line contains p,w,l where
>
I'm assuming small boards. For big boards it's not practical to have a
database style book of course.
You definitely must take into considerations board orientations. I suggest
using a database where the position is hashed. You can do your own or you
can use a lite sql database such as sqlite
Are you asking about in-memory storage, or on disk?
On disk, you probably want to make sure that it's as easy as possible to
maintain - up to your taste. Some people like a single SGF file with
variations. You can do mirrorring and transpositions when you load the book.
Christian
Willemien
>
> I was puzzeling what is the best way to organise an opening book?
>
Our solution was the following. We have two possible structures:
1) a big set of SGF games;
2) an opening book in which one line contains p,w,l where
* p is a situation
* w is the number of wins
* l is the number o
2009/6/17 Willemien :
> I was puzzeling what is the best way to organise an opening book?
It depends of how you program will play.
> i am writing a program to be very strong on 7x7 go program (as
> prelimary for writing a very strong 9x9 program ) and am wondering
> what is the best structure for
10 matches
Mail list logo
