Gerd Lorscheid wrote:
So my idea is:
1. If you have a game loaded in database A and B, you switch between
these games when you
switch the database. It is not possible to see the game of A, if B
is the actual database.
No data loss anymore.
That could be a nice temporary fix, but i still believe that we need the
ability to work with multiple boards.
The single board is, imho, the major disadvantage of scid compared to
chessbase.
2. The game listing of each database, each tree window has its
dedicated filter. For the game window
The filter consists of the same parts as today. Moving a peace on
the board does only update the
position filter if activated and keeps the others. For the tree
window the filter can be a just a header
filter. So if the user switches the database from A to B the game
listing shows the games with the filter
of B. No global filter anymore.
I don't understand this part.
Let's say I have a database with all twics.
I want to see the games from the corus tournament 2010 so i set the
filter accordingly.
I start to look at the first game and when i open the tree window to see
how long they stayed in teory, the filter is gone (damn!).
Example2
I'll have a game tomorrow so i search my opponents games to see the
opening he usually plays.
Again i start to look at the first game and when i open the tree
window.... (at this moment i fall on my knees and start cursing)
Very simple: the tree windows shouldn't automatically erase the current
filter.
When i want to update the filter with the current position i press
ctrl+shift+b and click search.
So I can set up a header filter for my game list window to view only
Kasparov games between
1980 and 1985 and then I can move on the board and see still only his
matching games. If I have
a tree window open, I can decide whether the games in the game window
are filtered also.
I can set up a header filter for the tree window to limit the
statistics to players with
a rating of 2400 or more.
The ability to open multiple tree windows on the same database with
different filters would be VERY useful.
I tried unsuccessfully to do that some times ago.
I started the easy way: set the tree to search only the filtered games.
So i set a filter (2500+ rating) and tree window shows stats only for
these games.
But it turns out that i prefer to have all the stats, the 2500+ and the
unfiltered, so i too ended up with two databases.
The problem is to keep updated all the databases, duplicating work.
If there is an agreement to go for this and somebody updates the UI
parts, I will try to
update the C++ parts.
Great.
My idea was to remove the filter code from sc_tree_search, so the tree
window don't change the current filter.
Doing so, the best games buttons don't works no more.
So for each base should be added a std::multimap that uses as key the
average elo of the two players and for value the game number.
In sc_tree_seach each time a match with the current position is found an
element should be added to the multimap and sc_tree_best should seach
the multimap instead of the current filter (in a perfect world the best
games windows can be docked as the other windows, and have a column for
the white player name, the white player elo, etc. where i can click to
have the results ordered by that value, as in chessbase, but let us not
to be too demanding :-)
Bye, Fulvio
------------------------------------------------------------------------------
This SF.net Dev2Dev email is sponsored by:
Show off your parallel programming skills.
Enter the Intel(R) Threading Challenge 2010.
http://p.sf.net/sfu/intel-thread-sfd
_______________________________________________
Scid-users mailing list
Scid-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/scid-users
