Re: [Scid-users] Tree problem with quick browsing

2008-04-24 Thread Michal Rudolf
Pascal Georges, piątek, 25 kwietnia 2008: >Do you use current CVS code ? Yes >I suppose "suggested moves" is on (or I don't get why the internal engine is >called), Yes >but can you give precisions on how you trigger this funny behavior Too bad. It seems I get it randomly. But here is what I g

[Scid-users] Engine window

2008-04-24 Thread Pascal Georges
Hi, I am on the way to compact engine window and added some tooltips on icons at the right. I will also remove the "lines" label and put a tooltip on the spinbox. So is anybody able to give nice icons for replacement of Training Annotate Add variation (I can reuse the +V icon) Add move Low CPU pr

[Scid-users] Some more bugs in Scid (and some wishes too)

2008-04-24 Thread Michal Rudolf
Bugs: B1: Remove previous/next moves - removes everything (BTW. before, "Remove previous moves" inconsistenly removed also current one) B2: Remove comments/variations doesn't work, resulting in 'Cannot strip the game' error. B3: Copied comments. (I reported it before). Take any game, move to sta

Re: [Scid-users] Tree problem with quick browsing

2008-04-24 Thread Pascal Georges
Do you use current CVS code ? I suppose "suggested moves" is on (or I don't get why the internal engine is called), but can you give precisions on how you trigger this funny behavior ? Pascal 2008/4/24 Michal Rudolf <[EMAIL PROTECTED]>: > The problem seems to persist in new versions too. > > Th

[Scid-users] Tree problem with quick browsing

2008-04-24 Thread Michal Rudolf
The problem seems to persist in new versions too. The console message is: # Yikes! Hash table move not in move list! Bug? The outcome is more or less random - for example multiple kings appear on the board (really!) Maybe callback from Scid core lacks some information? FEN is the simplest, but

Re: [Scid-users] Scid versus other databases

2008-04-24 Thread Michal Rudolf
Alexander Wagner, czwartek, 24 kwietnia 2008: >The point is, that if you pack all windows into a single one >you have to devide that window in sections. Two windows in >one column will have to have the same width, which is >definitely not the case if I just place two individual >windows in one co

[Scid-users] Shortcuts

2008-04-24 Thread Pascal Georges
Hi, I added those shortcuts to the list of key bindings that should be present in (nearly) all windows. For example it has always bothered me not to be able to navigate in a game with arrows when the focus was on the engine window. It is corrected now, but I wonder if there may be some drawbacks i

Re: [Scid-users] Scid versus other databases

2008-04-24 Thread Pascal Georges
2008/4/24 Alexander Wagner <[EMAIL PROTECTED]>: > > > Moreover, even Scid has many problems with keyboard focus > > - most shortcuts work only when you click on appropriate > > windows. > > I agree that the shortcuts are really a drawback of scid, or > more or less the necessity to enable the

Re: [Scid-users] Scid versus other databases

2008-04-24 Thread Alexander Wagner
Michal Rudolf wrote: Hi! >> Well I use this as well, but I do not agree with the >> argument that there is not enough space using individual >> windows. IMHO the contrary is the case! I mean with this >> (IMHO really silly) 3 pane stuff I'm locked to fire up >> something like Fritz maximised

Re: [Scid-users] Fast tree

2008-04-24 Thread pgeorges
Michal Rudolf a écrit : > pgeorges, czwartek, 24 kwietnia 2008: > > >> Scid loads games by blocks, of 32 kB each which corresponds to 300-400 >> games. So if you want to fill the filter for 1 games that are spead >> each in a different block because the base is unsorted, you will load >> 32

Re: [Scid-users] Fast tree

2008-04-24 Thread Michal Rudolf
pgeorges, czwartek, 24 kwietnia 2008: >Scid loads games by blocks, of 32 kB each which corresponds to 300-400 >games. So if you want to fill the filter for 1 games that are spead >each in a different block because the base is unsorted, you will load >320 MB ! And this takes time, unless every

Re: [Scid-users] Fast tree

2008-04-24 Thread pgeorges
Michal Rudolf a écrit : > Pascal Georges, środa, 23 kwietnia 2008: > > >> The code works in this way : the list of games found (call it LG) in the >> cache for the last time is kept as a basis to speed up further searches. For >> example 2 games for a base of 3M. If the game was not in LG w

Re: [Scid-users] Fast tree

2008-04-24 Thread Michal Rudolf
Pascal Georges, środa, 23 kwietnia 2008: >The code works in this way : the list of games found (call it LG) in the >cache for the last time is kept as a basis to speed up further searches. For >example 2 games for a base of 3M. If the game was not in LG when >scanning all 3M, I simply bail ou