I was there in 2005, and KCC Igo and Go Intellect were there.
http://www.computer-go.jp/gifu2005/English/
Ogaki is very nice, but a little tricky to get to by train.
I ripped up the full board search and rewrote it last year so I'll only go
if I can get it stable and stronger by then.
David
I also agree that 9x9 doesn't compare to 19x19. I disagree that it's
not interesting. It would be uninteresting if, for instance, someone
like you were just as good at the top pro's at 9x9. It stops being
interested when it can be mastered.If the top players can always
play a
Hi David,
(...) I cannot imagine that progress will be
made without a great deal of domain knowledge.
Depending on what you exactly mean I disagree.
I mean progress by the standard usually applied to computer Go:
programs that can beat 1D humans on a full board, and then get
better.
For me
On 7/10/07, Jacques Basaldúa [EMAIL PROTECTED] wrote:
Joshua Shriver wrote:
Any help is appreciated, trying to write a parse in C
There is free source code for that:
http://www.red-bean.com/sgf/sgfc/index.html
and GnuGo http://www.gnu.org/software/gnugo/
If you want to do something minimal
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
The reason for using a hashtable was: I was too lazy to implement an
explicit tree. At least at 9x9 I have no problem with memory size. In fact
there are
On 7/10/07, chrilly [EMAIL PROTECTED] wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
The reason for using a hashtable was: I was too lazy to implement an
explicit tree. At least at 9x9 I have
On Tue, 2007-07-10 at 16:14 +0200, chrilly wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
The reason for using a hashtable was: I was too lazy to implement an
explicit tree. At least at 9x9
On 7/10/07, chrilly [EMAIL PROTECTED] wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
Steenvreter has a hashtable.
The reason for using a hashtable was: I was too lazy to implement an
On 7/10/07, Jacques Basaldúa [EMAIL PROTECTED] wrote:
When you favor defense (or attack) you may think: This is unbiased
since some times it favors black and other times it favors white But
the fact is when black is in danger at the root of the tree, it is in
danger in most of the tree,
Nonetheless, a program that could not only play a decent game of go, but
somehow emulate the _style_ of a given professional would be of interest,
would it not?
Is this the case in chess? If so, I've never heard of it.
___
computer-go mailing list
On 7/10/07, Chris Fant [EMAIL PROTECTED] wrote:
Nonetheless, a program that could not only play a decent game of go, but
somehow emulate the _style_ of a given professional would be of interest,
would it not?
Is this the case in chess? If so, I've never heard of it.
I don't think that it
Was looking up engines when I came across the Go++ website. Is it
still the #1 engine in the world? Most of the titles on the page seem
to refer to the late 90's and early 2000's.
Anyway, the one thing that shocked me the most was Over 400,000
copies sold in Japan!
At $39.95 that's just shy of
At $39.95 that's just shy of $16 million. Wow Even at $1 a copy that's
almost 1/2 a million dollars.
I'm reminded of a post this list about 10 years ago (maybe by Mark
Boon?), probably in the context of winning the Ing prize: if you are a
very good programmer, there are easier ways to get rich
The list price in Japan is closer to $100 than $39.
This is my Japanese product (AI Igo version 15):
http://www.ifour.co.jp/product/aiigo15/ and you can see it lists for 13,440
yen (about $110). The other strong programs have similar prices. His
royalty is more than $1 per copy.
Since Go4++
14 matches
Mail list logo
