[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] SGC
|> See http://www.smartgo.com/HTML/index.html?compressedgamecollections.htm.
|>
|> In SGF, a sequence of moves is represented as follows:
|>
|> ;B[m1];W[m2];B[m3];W[m4];B[m5];W[m6];B[m7];W[m8];B[m9]
|> (9 x 6 = 54 characters)
|>
|> In an SGC compressed file, this is written as:
|>
|> ;S[m1m2m3m4m5m6m7m8m9] (4 + 9 x 2 = 22 characters)
|>
|> Since this is not compatible with SGF, SmartGo uses a different extension
|> (SGC) for such compressed files. I would encourage other authors of SGF
|> readers to support this simple compression scheme. For example, this reduces
|> the GoGoD collection from 40696 KB to 17171 KB (42% of original size). Not
|> only does it save megabytes on disk, it also speeds up reading large game
|> collections.
Dear Anders,
Interesting idea. Of course the actual diskspace saved will depend on
the blocksize of the partition containing the SGF files but in general
I expect the disk usage would drop by 50% for partitions with 1K-blocks
(eg GoBase.org). For disks with 4K-blocks the S[] format wouldn't safe
anything for the average SGF file (1-2KB).
Does an S[] sequence of moves always assume Black moves first?
So in a handicap the file would be encoded as: W[..]S[......]?
best regards,
Jan van der Steen
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/