RE: [computer-go] Yet another article

2007-05-26 Thread David Fotland
I threw it at Google translation, which is supposed to be the best machine
translator available now, using only Bayesian statistics with no knowledge.
 
It mangles it, but the meaning comes through.  It sounds like an interesting
article.  It would be nice to have a good translation.
 
David
 
Drosophila's luck and end God regarded everything, which it had made: It was
very good. It became evening and it became morning: the sixth day. Towards.
1,31 If I intend a larger financial transaction, I ask a friendly economist
over the prevailing opinion to this topic. Then I with some security, like
it does not become white and does not depend on it. In my Profession is
still simpler the thing. The prognoses John McCarthy's and its AI-young form
an entropy set. The area of the hopeless solutions. Stanley Kubrick' s HAL
and my Windows PCs have only one together: Sometimes goes nothing at all
more. 1989 published J. Schaeffer and M.Donskoy “Perspectives on Falling
from Grace”. The Confessiones of two successful academic chess programmer.
One betrayed the holy goal of the computer Drosophila by the longing of the
tournament victory. Schaeffers Bekehrungserlebnis was a bitter defeat
against chip test. It became again backdue however with the lady program
Chinnook. 1989 I worked in the European space Technology Centre in
Noordwijk/NL. In the damp and cold winter evenings I felt lonely and had
homesickness. Around this feeling to betäuben I bought the Mephisto Polgar
Brettcomputer of OD Schroeder. Playing against helped also nothing and
seized I one evening the resolution in such a way: I can bisserl games of
chess, I can program, why I do not make a chess program? The goal was, a PC
program, which can take up it with that. I had increased thereby the drug,
became sufficient depressing drums of the rain the pleasant mood music.
However I suffer until today from heavy craze features. Of the McCarthy'
Drosophila did not have I the smallest rope, McCarthy was me only as a
creator of its own programming language a vague term. It would have been
also perfectly all the same me: My goal was to betäuben and strike
homesickness. 1989 rank among the sieved fat years of computer chess. OD
Schroeder lives this very day of the pole percentages of profits. 1989
defeated chip test the first large masters. The first article over this
program carried the title by program „for Designing A single chip
Grandmaster while knowing emergency-hung about chess “. Chip test attained
as Deep Blue world fame. John McCarthy, which had formulated the victory
over the chess world champion once as warming up exercise for the actual
tasks of the AI, reacted in a book review in Science to Deep Blues summit
victory säuerlich. Three feature OF of human chess play acres required by
computers programs when they face of harder problems than chess. Two OF them
were used by early chess programs but were abandoned in substituting
computers power for thought. 1) Human chess players CAN emergency examine
all moves RK every position they think about and therefore must forward
prune the move tree and SELECT the more promising moves for exploration;
early chess programs thus pruned. About of 1969 forward pruning which
eliminated, and computer power which relied upon ton examine all moves. It
larva the programs work more better, because early programs sometimes pruned
good move. Eliminating pruning which possible, because there acres only
about 40 moves in A position. In the game OF Go, there acres UP ton of 361
moves in A position, then even computer forward prune must. McCarthy ignored
obviously 30 years development. Modern programs look for not brute force,
but use dynamic information, the structure of the search tree, in order to
extend and shorten variants both. My chess program Hydra looks for 17-18
sections in a central play position deeply. The shortest variants have a
length of 7, the longest up to 40 Plies. Contrary to the punch card age one
uses today „softly pruning “. Instead of completely cutting a course off,
the search tree is shortened. A search tree reduced by 2 Plies is not many
more expensive to omit than the course at all. The program has however the
chance to recognize incorrect Pruning in the following iterations while the
method publicised by McCarthy does not correct the error with infinite
search depth any longer. In addition these shortened searches produce
further information about the search tree, which can be used in consequence
profitable. Most programs compute only the first 3 courses „brute force “,
those remaining courses are strongly geprunt. The optimal exponential factor
amounts to with alpha beta 6, actually has the programs a factor of 3-4.
Without search extensions the factor would sink under 3. For Fritz
programmers fray to rotten lies therefore the intelligence of a program in
the search algorithm. 

-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of chrilly
Sent: Saturday, May 26, 2007 

Re: [computer-go] Yet another article

2007-05-26 Thread chrilly
MessageThe translation is not completly stupid (for an automatic translator). 
But its funny that it tries to translate English parts like the title of the 
first Chiptest/Deep Blue paper and mangles this completly. It fails to 
translate Austrian. E.g. bisserl (a little bit, ein wenig in German). These 
are the parts the German editors of my writings also want to translate to 
German.
But on the same time it shows that the translator misses any minimal context 
knowlegde. E.g. Checkers is called in German Dame, which means also Lady.
Lady is statistically the better guess, but in this context the lady programm 
Chinnok is of course completly stupid.

The most funny translation is Fuer Fritz Programmierer Frans Morsch  to For 
Fritz programmers fray to rotten.  morsch means in German indeed rotten. But 
Frans is no valid word.  As the name is written in uppercase the translation 
programm should have known that it can not mean rotten. I know no German 
language construct where one can write morsch in uppercase (besides at the 
beginning of a sentence). But upper/lowercase rules are in German extremly 
complicated. Constructs like Fritz Programmierer Frans Morsch are typical for 
my writing style. According my wife (she has studied linquistics) its a bad 
habit and not real German. The translator expected therefore some verbs.

I do not now why Ed Schroeder is made to OD. Ed is also no German word.  What 
does OD mean?

Bayesion pattern matching is also tried in Go. I think the results are similar. 
There are some meaningfull game fragments reproduced, but overall it lacks any 
higher meaning. The approach also fails when the player deviates either on 
purpose (like in bisserl) or because he has learned bad style (e.g. Fritz 
Programmer Frans Morsch).

Chrilly

- Original Message - 
  From: David Fotland 
  To: 'computer-go' 
  Sent: Saturday, May 26, 2007 6:55 PM
  Subject: RE: [computer-go] Yet another article


  I threw it at Google translation, which is supposed to be the best machine 
translator available now, using only Bayesian statistics with no knowledge.

  It mangles it, but the meaning comes through.  It sounds like an interesting 
article.  It would be nice to have a good translation.

  David

  Drosophila's luck and end God regarded everything, which it had made: It was 
very good. It became evening and it became morning: the sixth day. Towards. 
1,31 If I intend a larger financial transaction, I ask a friendly economist 
over the prevailing opinion to this topic. Then I with some security, like it 
does not become white and does not depend on it. In my Profession is still 
simpler the thing. The prognoses John McCarthy's and its AI-young form an 
entropy set. The area of the hopeless solutions. Stanley Kubrick' s HAL and my 
Windows PCs have only one together: Sometimes goes nothing at all more. 1989 
published J. Schaeffer and M.Donskoy Perspectives on Falling from Grace. The 
Confessiones of two successful academic chess programmer. One betrayed the holy 
goal of the computer Drosophila by the longing of the tournament victory. 
Schaeffers Bekehrungserlebnis was a bitter defeat against chip test. It became 
again backdue however with the lady program Chinnook. 1989 I worked in the 
European space Technology Centre in Noordwijk/NL. In the damp and cold winter 
evenings I felt lonely and had homesickness. Around this feeling to betäuben I 
bought the Mephisto Polgar Brettcomputer of OD Schroeder. Playing against 
helped also nothing and seized I one evening the resolution in such a way: I 
can bisserl games of chess, I can program, why I do not make a chess program? 
The goal was, a PC program, which can take up it with that. I had increased 
thereby the drug, became sufficient depressing drums of the rain the pleasant 
mood music. However I suffer until today from heavy craze features. Of the 
McCarthy' Drosophila did not have I the smallest rope, McCarthy was me only as 
a creator of its own programming language a vague term. It would have been also 
perfectly all the same me: My goal was to betäuben and strike homesickness. 
1989 rank among the sieved fat years of computer chess. OD Schroeder lives this 
very day of the pole percentages of profits. 1989 defeated chip test the first 
large masters. The first article over this program carried the title by program 
for Designing A single chip Grandmaster while knowing emergency-hung about 
chess . Chip test attained as Deep Blue world fame. John McCarthy, which had 
formulated the victory over the chess world champion once as warming up 
exercise for the actual tasks of the AI, reacted in a book review in Science to 
Deep Blues summit victory säuerlich. Three feature OF of human chess play acres 
required by computers programs when they face of harder problems than chess. 
Two OF them were used by early chess programs but were abandoned in 
substituting computers power for thought. 1) Human chess players CAN emergency 
examine all 

[computer-go] Most common 3x3 patterns

2007-05-26 Thread Peter Drake
I've thrown together a rudimentary pattern extractor and was looking  
at 3x3 patterns taken from a collection of 9x9 games provided by Nici  
Schraudolph.  Each game was played through
in each of the four rotations and two reflections. Colors were  
inverted every other move, so all of these patterns have black to  
play in the center.


Looking at the data below, it appears that:

a) It might be better to somehow take into account the ratio between  
how often the pattern appeared and how often the corresponding move  
was played.

b) Endgame moves appear often, because they get played sooner or later.
c) Tesuji don't appear as often as one would hope. Connecting against  
a peep, making a bamboo joint, and the diagonal cut are not among the  
top patterns.


Let the thread begin!

The actual information:

134008 occurrences of
...
.?.
...

(Fair enough, you need a lot of these.)

9794 occurrences of
...
.?.
Bw.

(And similarly for the other 7 transformations of this. Hane.)

7444 occurrences of
...
.?.
.w.

(3 transformations. Contact play or attachment.)

7170 occurrences of
...
.?.
w..

(3 transformations. Shoulder hit.)

5512 occurrences of
###
.?.
Bw.

(7 transformations. Hane underneath -- is there another term?)

4840 occurrences of
...
w?.
Bw.

(3 transformations. Crosscut.)

4489 occurrences of
...
w?.
wB.

(7 transformations. Is there a name for this?)

4054 occurrences of
...
B?.
wB.

(3 transformations. Preventing a crosscut? Closed triangle?)

3922 occurrences of
...
.?.
wB.

(7 transformations. Anti-hane?)

3806 occurrences of
...
.?.
B..

(3 transformations. Diagonal connection.)

3656 occurrences of
###
.?.
BwB

(3 transformations. Connection underneath.)

3597 occurrences of
...
w?.
.B.

(7 transformations. Name?)

3197 occurrences of
...
w?.
BB.

(7 transformations. Another full triangle.)

3196 occurrences of
..#
.?#
Bw#

(7 transformations. Blocking on the first line -- VERY endgame.)

2986 occurrences of
###
B?.
wB.

(7. Connecting on the first line?)

2892 occurrences of
...
.?.
BwB

(3. Potentially a capture.)

2456 occurrences of
...
.?.
wBw

(3. The opposite of the previous pattern.)

2300 occurrences of
###
.?.
Bww

(7. Name?)


Peter Drake
http://www.lclark.edu/~drake/



___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/