[no subject]

[Heikki Levanto <heikki@xxxxxxxxxxx>]

To: computer-go@xxxxxxxxxxxxxxxxx
Subject: Re: transposition table
Cc: heikki
Newsgroups: lsd.compgo
Organization: LSD - Levanto Software Development
X-Newsreader: TIN [version 1.2 PL2]

Serge Boisse STNA 7P (33) 562 14 5731 (boisse@xxxxxxxxxxxxxxxxx) 
wrote in lsd.compgo:

: This works fine as long as  (super) Ko is not relevant for the position, (I
: notice a great speed improvement), but  when Ko or super Ko is relevant, there
: are several positions which are the same (thus same hash), but whose best moves
: are not the same.

I am not quite sure that I understand what you are doing, but to me it
sounds like you are trying to take a bad shortcut with the ko problem.

You have a function that maps a board position to the best move in that
position. I feel that in the representation of the position you have to
include any moves forbidden by your ko rule. Only then do you have clearly
distinct positions that have a well-defined best move to map into!

You could either keep a list of forbidden moves (and include that in your
position hash), or of [hash values of] all previously seen positions (and 
include them somehow in your hash value)

Just my $0.02

	Heikki Levanto
	7 kyu player
	Dan level prgrammer
	with far too little time to program GO :-(


--
Heikki Levanto  LSD - Levanto Software Development   <heikki@xxxxxxxxxxxxxxxxx>