Re: [computer-go] Zobrist hashing with easy transformation comparison

2007-02-10 Thread Erik van der Werf
On 2/10/07, Łukasz Lew [EMAIL PROTECTED] wrote: On 2/10/07, Antoine de Maricourt [EMAIL PROTECTED] wrote: If there is strong interest, I can post the scheme. Please do. Since Antoine claims there is only on solution I might as well post mine ;-) mirroring: [abcdefgh] - [hgfedcba] rotation:

Re: [computer-go] Zobrist hashing with easy transformation comparison

2007-02-10 Thread Jacques Basaldúa
As Antoine de Maricourt says, this weakens the key. I think it is a serious problem and it is a dangerous answer to a small question. I compute hashes and patterns for database lookup eight at a time, which is faster (much more optimizable) than one after the other. Then I also use the smallest

Re: [computer-go] Serializing a very large object in Java

2007-02-10 Thread Jacques Basaldúa
Peter Drake wrote (3 times): Exception in thread main ... . . . and 91.449 bytes later . . . ... (ObjectOutputStream.java:1369) I studied the log file in depth and the problem is . . . . . . (you guessed) using Java ;-) Jacques. BTW. I store this list. If you need your log file in the

Re: [computer-go] Zobrist hashing with easy transformation comparison

2007-02-10 Thread Erik van der Werf
On 2/10/07, Jacques Basaldúa [EMAIL PROTECTED] wrote: snip But the question is: Does someone do the opposite, i.e. playing with the hash values to make then *stronger*? And then we get another small questions with a dangerous answer... Just search the archive for BCH construction. E.

Re: [computer-go] Paper presents results on proximity heuristic

2007-02-10 Thread Darren Cook
This was not tested in any formal way, but including the book does seem to increase the chance that the program will open with E5 (which I believe is the correct opening move on 9x9) ... Just a side note, as I've spent a lot of time studying high-level 9x9 games. I've seen strong players win