Go back
Sort games by moves (by opening)

Sort games by moves (by opening)

Site Ideas

Vote Up
Vote Down

I'm beginning to have a problem finding games in my archives.
Right now games can be sorted by date, by opponent, etc., but I'd LOVE the ability to have games sorted by, say, the first 20 half-moves. That way all my KGA games would fall together, etc.

Vote Up
Vote Down

Originally posted by CrawlIce
I'm beginning to have a problem finding games in my archives.
Right now games can be sorted by date, by opponent, etc., but I'd LOVE the ability to have games sorted by, say, the first 20 half-moves. That way all my KGA games would fall together, etc.
Yea, if this site recognised openings, like some other servers do, that would be great! rec.

Vote Up
Vote Down

Originally posted by CrawlIce
I'm beginning to have a problem finding games in my archives.
Right now games can be sorted by date, by opponent, etc., but I'd LOVE the ability to have games sorted by, say, the first 20 half-moves. That way all my KGA games would fall together, etc.
You can always creae a folder just for those games and store them in there.

Vote Up
Vote Down

Originally posted by CrawlIce
I'm beginning to have a problem finding games in my archives.
Right now games can be sorted by date, by opponent, etc., but I'd LOVE the ability to have games sorted by, say, the first 20 half-moves. That way all my KGA games would fall together, etc.
Mabey we will get something like this when redhotpawn has the computing power of google

Vote Up
Vote Down

Originally posted by blindcheesecake
Mabey we will get something like this when redhotpawn has the computing power of google
There are 500 ECO classifications. It shouldn't be an issue to at least institute it for finished games.

Vote Up
Vote Down

Originally posted by XanthosNZ
There are 500 ECO classifications. It shouldn't be an issue to at least institute it for finished games.
Actually, it wouldn't even require that. Each move can be represented by 2 bytes reflecting the from-square (1-64) and the to-square (1-64). That means 20 plies can be translated into a 40-byte key. Simply sort on the forty-byte key and you don't need to know opening classifications at all.
That would serve my purpose. ;-)