[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: computer-go: Who has (read) the manuscript of Sei & Kawashima (2000)?



Dear Erik,

>Dear Shinichi Sei,
>
>Thank you for putting the translation on-line, it's very interesting.
>
>I still have some questions:
>
>- Can you say anything on time? How long did it take to solve 4x4?

Sorry, I don't remember.

>- Can you make an estimate of the number of nodes and/or the amount of
>time that would be required to solve 5x5 (and 6x6)?

No.
May be very very very huge.

>- Did you ever compare the performance of your move ordering heuristics
>to domain-independent move ordering heuristics, such as the combination
>of first the transposition move, then 2 Killer moves, and ordering the
>rest by the history heuristic?

No, I didn't.

>- Did you use iterative deepening?

No, I didn't.

>- Your evaluation value was one of three values( win/defeat/draw ), did
>you try heuristic values to guide the search? Did it take more nodes on
>4x4? I guess that on larger boards heuristics, such as the differences
>in points, may actually reduce the number of nodes by improving the move
>ordering.

No, I didn't.

>Best regards,
>Erik

Research of Computer Go is not my regular job.
So, I did not have enough time to do another experiments.

Sincerely,

---
Shinichi Sei : ssei@xxxxxxxxxxxxxxxxx
http://homepage1.nifty.com/Ike/katsunari/index.html   (Japanese)
http://homepage1.nifty.com/Ike/katsunari/index_e.html (English)