In (at least) some implementation, it is far easier to check for captures than
to check for "atari".
It sounds very close to what you do, the difference being.
"has the group exactly 1 liberty ?". (atari)
"has the group exactly 0 liberty ?" / "at least 1 liberty"
The later is faster.
- it is faster when using the concept of pseudo liberty (faster to
incrementaly make up)
- until you get some really fast way of counting 1 and 0 in an integer, it is
faster when using bitmaps for liberties.
(you then only have to check weither it is full 0 map or not)
BUT most advanced engines do have a LOT of use for the atari status of strings.
If only speed is your goal, you'll probably have to use the "has no liberty ?"
test as much as you can.
(probably this lead to : "make the move, then check the 0 liberty status of
adjacent ennemi/ 0 liberty status of new made -fusionned- friendly group,
eventually cancel the move if not legal)
To me 10K light-playouts(no self pseudo-eye fills) on a 19x19 sounds very fast
:)
I don't know how it compares to libego though. But then, do libego provides the
"is in atari" status for strings ?
It seems to me that having the bitmap for each groups of stone on the board,
and the liberty maps for each of those groups is a strong basis for heavy
playouts experiments. So your library (if it provides this) would have a great
potential for all the students conducting experiments on go montecarlo tree
decision :)
Date: Mon, 7 Dec 2009 11:43:05 -0800
Subject: Re: [computer-go] [ANNOUNCE] BitmapGo mockup version 2.0 (for MS
Visual C++ and g++)
From: [email protected]
To: [email protected]
"Strictly legal" refers to all the empty points that provide at least one
liberty to a friendly group if a friendly stone would be placed on that point.
The liberty can be provided (i) by an empty neighboring point, (ii) by a
capture of a neighboring enemy string (i.e., a neighboring enemy string that
currently is in atari), or (iii) by connecting to a neighboring friendly string
that is not currently in atari (otherwise I just played on its last liberty).
Both the second and third criterion require knowledge of the atari status of
strings.
[...]
However, the question remains for the first part of the move selection, which
determines which move candidates are considered "strictly legal".
René
_________________________________________________________________
Nouveau ! Tout Windows Live débarque dans votre téléphone. Voir les Windows
phone
http://clk.atdmt.com/FRM/go/175819071/direct/01/
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
