Hi,
It seems that CGOS 9x9 is down: it only asks the name, password and
command list to the engine. It says on the web interface that games are
playing, but this webpage is not refreshing.
Cheers,
Guillaume
___
computer-go mailing list
The attached game played on CGOS was awarded a win for white due to an
illegal move. Black tried to play J3, which according to the game-
record is a ko. Nothing could be further from the truth...
Rather shocking really. What happened here?
Mark
684276.sgf
Description: Binary data
Look at the board position at move 77 (black C9). The move of Black J3 is
both a violation of positional superko (used by CGOS) and the more lax
situational super ko.
On Fri, Jan 9, 2009 at 12:40 PM, Mark Boon tesujisoftw...@gmail.com wrote:
The attached game played on CGOS was awarded a win
If black plays J3, we would have the same board position as after move
77, thus violating superko.
/Ola Mikael Hansson
On Fri, Jan 9, 2009 at 6:40 PM, Mark Boon tesujisoftw...@gmail.com wrote:
The attached game played on CGOS was awarded a win for white due to an
illegal move. Black tried to
I'm a bit confused about the difference between AMAF and RAVE (if there's one).
As far as I understand, with AMAF, you sample in each playout (after it leaves
the tree) the moves played (by both players), but only the first move at any
position, then you reward all moves played either by a win or
Mark Boon wrote:
The attached game played on CGOS was awarded a win for white due to an
illegal move. Black tried to play J3, which according to the
game-record is a ko. Nothing could be further from the truth...
Rather shocking really. What happened here?
Mark
It is a superko. Note that
Hi Isaac,
in a nutshell RAVE is basically AMAF adapted for Monte Carlo Tree Search.
The original paper describing it is
http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf and a
paper for broader audience can be found here:
http://www.lri.fr/~gelly/paper/MoGoNectar.pdf (the picture
Hi Sylvain,
Thanks for your quick answer.
in a nutshell RAVE is basically AMAF adapted for Monte Carlo Tree Search.
The original paper describing it is
http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf and a
paper for broader audience can be found here:
Good news!
I am very happy the ICGA has chosen Pamplona. Other destinations (e.g.
Beijing)
are more attractive, but way out of my reach. I can travel to Pamplona
easily, but
cannot find the details. The website at http://www.icga.org/ is not
updated and the
attached .eml file contains 2 .pdf
Jacques Basaldúa wrote:
Can someone place the .pdfs somewhere for download? Thanks.
They are in the Game Programming Forum:
http://www.grappa.univ-lille3.fr/icga/phpBB3/viewtopic.php?f=15t=67
Rémi
___
computer-go mailing list
Hi Isaac,
2009/1/9 Isaac Deutsch i...@gmx.ch
Hi Sylvain,
Thanks for your quick answer.
in a nutshell RAVE is basically AMAF adapted for Monte Carlo Tree Search.
The original paper describing it is
http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf and a
paper for
I notice that the 2008 icga chess tournament is limited to 8 cores.
David Levy's justification seems curious to me. He mentions that an early
microcomputer held its own against a mighty mainframe, and that many top chess
programs run on PCs, but he wishes to discourage being able to buy the
I think general hardware limits are good, because they will permit
more teams to be competitive without altering the nature of the
competition.
___
computer-go mailing list
computer-go@computer-go.org
Had rules like this been in affect in earlier years, where you limit
participants to commodity hardware, we would have never seen Cray Blitz,
Deep Blue, Bebe, Belle and others that were a very important part of
computer chess history.
This comes down to whether you are trying to turn this into
14 matches
Mail list logo
