On Tue, 2007-10-23 at 22:31 +0200, Gunnar Farnebäck wrote:
>
> But I can provide a hint for something I would find useful. If it's
> something I'm missing in today's sgf viewers it's a good way to dump and
> inspect a transposition table. It's possible to expand the
> transpositions into a big tree with duplicate subtrees but that makes it
> very difficult to traverse it efficiently. Alternatively the tree is cut
> off when the same position is reached again but then there's no easy way
> to find where the position was first reached, which is needed to follow
> the continuations.
>
There have been proposals for this on the SGF mailinglist, IIRC.
For a similar purpose (a joseki library), I have used the Node Name
("N" property) for this purpose, which is acceptable for 'private use';
but for real functionality the SGF-browser should be aware of this
usage.
A real extention should either implement 'unique node names', or use a
label+goto -like mechanism.
An advantage of using the N[] property is that it will not break
existing implementations.
Another feature request (by Frank de Groot of moyogo fame, IIRC) was the
introduction of 'compressed movelists', eg
;BW [ddppdp]
instead of
;B[dd] ;W[pp] ;B[dp]
This would allow for a more compact representation of games. (for
storing them in fixed-size database records, etc.)
Adriaan van Kessel
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
