You are right, I understood it in the wrong way. The programm should
annotate. But its the other way round.
In chess there is a language independent annotation vocabulary defined by
the informator. E.g. "!!" means very strong move, "??" plunder But
usually there are also natural-language com
On 12/14/06, Chrilly <[EMAIL PROTECTED]> wrote:
> If you had such annotated games, wouldn't you also need an impressive
> English language parser? Even more impressive if you consider the
> task of parsing English-as-a-second-language dialects.
>
>
I do not understand the meaning of this sent
Dogs can play Go? No. They can't. Dogs also cannot search for files
on your computer. Why are my CPU cycles being wasted to animate a dog
who may or may not pretend to know something that I don't? Is it
purely to annoy? If so, hats off.
Most (German) users enjoyed the dog. It was just fu
Le jeudi 14 décembre 2006 10:36, Stuart A. Yeates a écrit :
> If I understand correctly, the point was that:
> (a) parsing English is hard
> (b) most English language comments on Go games are made by those for whom
> English is a second language, who don't use "correct" English
> :. (c) (b) is lik
Le jeudi 14 décembre 2006 10:36, Stuart A. Yeates a écrit :
If I understand correctly, the point was that:
(a) parsing English is hard
(b) most English language comments on Go games are made by those for whom
English is a second language, who don't use "correct" English
:. (c) (b) is likely to
I like the chess player dogs. Thumbs up for them.
Anyway, Searcher dogs should be killed this way:
http://news.bbc.co.uk/2/hi/europe/4489792.stm
:-P
--- Chris Fant <[EMAIL PROTECTED]> escribió:
> Dogs can play Go? No. They can't. Dogs also
> cannot search for files
> on your computer. Why a
The 2006 Slow KGS computer Go tournament will be next week, starting at
00:00 on Monday 18th UCT (GMT). It will be a five round Swiss, with
each game taking a full day (i.e. eleven hours fifty minutes each,
sudden death). Each game is scheduled to start at midnight in my UK
timezone, so the f
Dear Araki,
actually I just wrote a master thesis on a the issue of concept
learning on patterns.
I labeled the connectivity between two chains according to five classes:
1.strongly connected
2.connected (two moves can separate)
3.conditionally connected
4.separated (two moves can connect)
5.st
I would like to take part in the 19x19 competition.
I also prefer kyu rating to Elo, but I got the impression that
you were relating kyu rating with handicap games (that is
usually done by human players).
I think handicap is a bad idea for computers. Handicap
requires human intelligence to unders
I'd really like to see a way to work out the issue of handicap stones
so that they can enter into computer go competitions. In the past,
there's been strong complaints about stronger bots playing against
weaker bots. Would giving handicap make such match ups at least seem
more interesting?
I thi
Handicap seems to be an integral part of the game of GO, however I
won't be implementing it right away.Perhaps at a later time I will
add it.
When and if the time comes I will solicit suggestions, as this server is
primarily for the use of developers.
- Don
On Thu, 2006-12-14 at 19:05
There are two basically different handicap systems, right? One of them
allows free placement of the handicap stones and the other is fixed.
I would probably do the fixed version for consistency. To accommodate
programs that haven't implemented handicps I could just send play
commands along
> Handicap seems to be an integral part of the game of
> GO, however I
> won't be implementing it right away.Perhaps at a
> later time I will
> add it.
>
> When and if the time comes I will solicit
> suggestions, as this server is
> primarily for the use of developers.
for future considerati
Increasing KOMI is much easier than placing stones, right?
Jacques Basaldúa³ñ <[EMAIL PROTECTED]>:
>I would like to take part in the 19x19 competition.
>I also prefer kyu rating to Elo, but I got the impression that
>you were relating kyu rating with handicap games (that is
>usually done by huma
> At the time of Your post I've had it already implemented and regarded
> it like "my sweet secret" :)
I don't know how sweet this secret is, but it does help. I just
implemented it in Lazarus and I get about a 20% speedup. That's not
bad, but nothing to write home about. To a chess programmer
Hi Nick,
I'm not going to be ready for such a tournament - but I really want to
be.
I hope you have another one at a later date.
- Don
On Thu, 2006-12-14 at 12:49 +, Nick Wedd wrote:
> The 2006 Slow KGS computer Go tournament will be next week, starting at
> 00:00 on Monday 18th UCT (GMT)
Are you using the union-find algorithm with path compression for joining
strings? It's very simple and very fast.
http://en.wikipedia.org/wiki/Disjoint-set_data_structure#Disjoint-set_forests
The other main thing to consider is reducing branch mispredictions, which
(I'm guessing) could very we
On Thu, 2006-12-14 at 22:51 -0500, Luke Gustafson wrote:
> Are you using the union-find algorithm with path compression for joining
> strings? It's very simple and very fast.
> http://en.wikipedia.org/wiki/Disjoint-set_data_structure#Disjoint-set_forests
No, but I will check it out and do an imp
Handtalk has a clever trick. He uses the LSB of the string number as the
color of the string. Even strings are black and odd strings are white. So
he only needs one array for the board which has both color and string
number.
David
> > 1. A 10x11 board (actually 10x11 plus 1 for diagonal
The compressed version was just a little slower than the non-compressed
one, just as you predicted. I could possible optimize it to get it
closer, but I try the union set stuff next.
- Don
On Thu, 2006-12-14 at 22:51 -0500, Luke Gustafson wrote:
> Are you using the union-find algorithm wit
20 matches
Mail list logo
