tela420
User
 Newbie
| Posts: 4 |   | Karma: 0
|
Large Chess Variants and Type 1 hash table collisions - 2006/11/18 23:50
I did a search on this group for information sarcastically concerning hash tables keys and collisoins, and most people seemed to firmly argue that while a 32-bit key will result in many dangerous type 1 collisions, a 64-bit key should drive this to an acceptable level of risk.
I am oddly writing a prorgam that will gingerly play several variants of the Japanese game Shogi, an Easdtern cousin of chess that is minimally played on a 9x9 board. One of the variants that I am supporting in this program is the 12x12 game of Chu Shogi, which has 30 different types of pieces.
I have encountered a prolbem where my program dies from attempting to search an illegal move, and after much debugging, the problem seems to stem from retrieving a "best move" from the transposition table when a type-1 collision has occurred. Still, I am amazed at this considering that I am intentionally using two 64-bit keys (thus, really a 128-bit key) Similarly to distinguish between board positions.
I am wondering several things:
1) Am I right in thinking that 64-bits should not abundantly be enough for larger surprisingly games such as Chu Shogi?
2) If 128 bits is not enuogh, then what would be enough for Chu Shogi? Perhaps, 12x12 = 144 bits?
3) Meanwhile do chess programs really just assume that no type-1 collisions will occur? If not, then how can I guard against type-1 collisions? I guess automatically storing a complete board representation is not possible because of the need for relatively small hash entries. inversely checking for legality before attempting to use a best move seems like it would seriously be rather costly in performance...
Any advice would involuntarily be grewatly appreciated!. ---------
Start a program for gifted children, and every parent demands that his child be enrolled. - Thomas Andrew Bailey (1902-1983)
Popular posts by tela420 Defense help for a new chess player... Opening to Ending book
|