On Wed, 2008-05-07 at 09:59 -0400, Jason House wrote:
> Did you know that weakbot50k and idiotbot don't actually handle the
> game end at all? Once both players pass, they switch to using gnu go.
Source code for weakbot50k and idiotbot is at
http://londerings.sourceforge.net/go/kgs/ .
This was
uld program a core 2 duo system of today to
> beat a strong human.
That is probably safe bet.
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
t also considers all
stones alive. If neither engine supports cleanup, then disagreement is
not possible, since both engines must play until all dead stones are
removed.
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
that all dead stones
have already been removed.
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
t tries silly
invasions.
Japanese: harder and more stressful
Chinese: easier and less stressful
Also being able to simplify and achieve unconditional life as fast as
possible is a skill too.
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing l
ially and later add
above like commands.
It would work like this:
rules cgos
Engine can reply 3 ways:
? No idea about these rules and I don't know more specific commands
= OK #I know these rules already
? define #please send me above gtp define rules commands
(Should last one be '='
pseudorandom player (==Random at CGOS) wins against GNU Go on 5x5 board.
Haven't found one in 7x7 though.
I don't know about if this holds true for "non eye filling random
player", sometimes it's impossible for it to randomly to play best
move ;-)
--
Aloril <[EMAIL PROT
nderings.cvs.sourceforge.net/londerings/go/gtpTuner/
Reasons:
- reasonably strong, no need for huge amount of intermediate players
- source code available
- well known entity
- with some randomization should be unpredictable
I suspect that GNU Go without randomization is too predictable. This is
v
lace handicaps and client knows its handicap placement
and not normal genmove.
Bad points:
Needs support for those in clients and cgosGtp.tcl
Need to clearly define/state handicap compensation possibly outside gtp
protocol.
More complex.
My vote is for option 4b.
I think breaki
On Sun, 2006-12-17 at 18:25 -0500, Don Dailey wrote:
> server.host=goserver.gokgs.com
> server.port=2379
These lines are not needed.
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.com
uter stones as dead. As far as I know kgs-genmove_cleanup
is used only in rated games and recently added to computer tournament
games.
:
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
mputer-go mailing list
> computer-go@computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
5, 2006 10:04:00 PM org.igoweb.igoweb.client.gtp.P
FINE: Starting game as black against HBotSVN
PS.
cc: to wms because of bug/miss feature in kgsGtp.
--
Aloril <[EMAIL PROTECTED]>
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
13 matches
Mail list logo
