Re: computer-go: unmake move?

[Darren Cook <darren@xxxxxxxxxxxxxxx>]

>>In your paper you give an example of reading to catch
>>a 4 stone group in figure 4.  You say that it takes
>>787 nodes with abstract proof search and 44K nodes
>>with heuristic search.  I assume the tactical
>>problem is White to move and capture 4 stones.
>>
>>Many Faces's heuristic search only looks at 27 nodes
>>to solve this one.  So you still have lots of room for
>>improvement :)  The heuristic tactical move generator
>>only selects one non-optimal move in this search for
>>white, and gets the correct move on the second try.
>
>By the way, I do not understand how you get 27 nodes,

I was waiting for Tristans reply to this. The reply I was expecting was
that Tristans program searches for all possible moves that work, while Many
Faces stops as soon as it finds one move that works. Is that not the case
here?

>It would be quite useful to have a non-copyrighted database of
>problems for capturing strings and connecting them. So as to
>enable a comparison of our respective algorithms, and to

Yes. The test set you have sounds like a good one - I wonder what is
involved in getting the publishers/authors permission to use it for
research purposes? E.g. if the programmer signs something to say they will
not give it to anyone else and only use it for testing with.

Darren