Chrilly wrote:
> Is it some sort
> of proove or just an example the author has found?
Not a proof, but if you add the number of two-space empty
regions in his example to 277, then that is a good guess of
an upper bound.
--
robert jasiek
___
computer-
This is a practically important figure. I have severall fixed
data-structures which depend on the maximum number of strings. I put it to
300, because I was not sure. So I can save a few entries in the future.
There is of course the question how sure this number is. Is it some sort of
proove or j
GPW(Game Programming Workshop) was held 10th-12th November 2006 in
Hakone, Japan. And Youhei Yano reported the maximum number of strings
in 19x19 is 277.
19 O . O X O . O X O . O X O . O X O . O
18 X O X . X O X . X O X . X O X . X O X
17 . X O X O . O X . X O X O . O X O X .
16 X O . O X . X O
Greetings guys.
Ive implemented standard minimax algorithm but is so enormous slow even on
9x9 board. For example when depth = 3 (player1 move, player2 move, player1
move) computing time at the begining is like 1 minute.
I know that I should implement alpha-beta pruning variation to speed up it
b
