Search found 634 matches

by Desperado
Thu Feb 26, 2009 1:54 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Replacement Scheme / Hash Hits
Replies: 11
Views: 2178

Re: Replacement Scheme / Hash Hits

Hi Stan, as i replied before, my numbers are similar to your numbers. But i recognized a big difference. When i said TT_hits, i thought of positions i can find in the TT. Then i saw your hashCUT numbers. My HashHITS are similar to your HashCUTS (i have much lower cutrate). I am using pvs-frame, and ...
by Desperado
Thu Feb 26, 2009 11:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Replacement Scheme / Hash Hits
Replies: 11
Views: 2178

Re: Replacement Scheme / Hash Hits

hm,ok. let us see if i have understood what you wrote...(hg muller) instead of partition the TT into "single" entries, i can partition it into some kind of buckets including (let us say 2 entries) each bucket. Before writing, i check all entries in the bucket and replace the worst compared to some c...
by Desperado
Thu Feb 26, 2009 9:49 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Replacement Scheme / Hash Hits
Replies: 11
Views: 2178

Re: Replacement Scheme / Hash Hits

oh i forgot...

can somebody explain to me how "age" is handled in TT ?
(on iteration ? on new search ? how does a TT-entry ages or the TT itself or both ?) . Well, i dont think it is the same as depth-comparison, or is it?
by Desperado
Thu Feb 26, 2009 9:02 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Replacement Scheme / Hash Hits
Replies: 11
Views: 2178

Replacement Scheme / Hash Hits

Hi everyone ! I am searching for several days for bugs in my transpositiontable modul. I cant find some. So my question now is, can somebody give me some percent numbers for the following position under following conditions... 1.Condition: always replace scheme (in hope the numbers are comparable th...
by Desperado
Sat Feb 14, 2009 8:52 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: In C++, one does ? for circular dependencies?
Replies: 11
Views: 3419

Re: In C++, one does ? for circular dependencies?

Funny (a little bit) the thread here :-). We are back to the roots :-) But talking about such basics i would like to add my statement once again: For me: - a Declaration (doesnt matter c / c++ elsewhere) just lets the compiler know that there is existing something(a type,class whatever).if this cont...
by Desperado
Fri Feb 13, 2009 12:29 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: In C++, one does ? for circular dependencies?
Replies: 11
Views: 3419

Re: In C++, one does ? for circular dependencies?

Hi Rein, maybe ... overread this, the problem to solve was the "declaration problem", i just use it in my testcode to be able to compile... maybe dependent on compiler, but generally you have to do this: //DECLARATION !!! //class X; should be declared class Y; //has to be declared so class X know cl...
by Desperado
Fri Feb 13, 2009 12:21 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: In C++, one does ? for circular dependencies?
Replies: 11
Views: 3419

Re: In C++, one does ? for circular dependencies?

maybe dependent on compiler, but generally you have to do this: //DECLARATION !!! class X; class Y; //DEFINITION !!! class X { private: public: int G( Y &t); }; class Y { private: public: int C( X &m); }; void main (void) { } now there shouldnt b...
by Desperado
Tue Feb 10, 2009 12:30 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI PROTOCOL AND CB-GUI
Replies: 9
Views: 1604

Re: UCI PROTOCOL AND CB-GUI

hi ernest, nice to know that uci-rybka has an own clear-hash button (funny), i never noticed it because in the cb-gui it isnt shown.(version2.3x) any of the uci-engines(fruit,toga,glaurung...and a lot more) has a "simple" button under cb. (Engine-Parameter-Window) And whats up with the "always prese...
by Desperado
Tue Feb 10, 2009 12:10 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Magic Bitboards AND optimal shifts
Replies: 3
Views: 1034

Re: Magic Bitboards AND optimal shifts

if i could i would delete my totally confused post.

:oops: Sorry...
by Desperado
Mon Feb 09, 2009 6:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Magic Bitboards AND optimal shifts
Replies: 3
Views: 1034

Magic Bitboards AND optimal shifts

Hi all, i am interested in what you are thinking about the following...(rook/queen shifts as example) /* #define MSK_R(OCC,SQ) (OCC & msk_r[SQ]) #define MAGIC_R(OCC,SQ) ((MSK_R(OCC,SQ) * mgc_r[SQ]) >> shr_r[SQ]) // a normal shift set... extern const UI_08 shr_r[ID_64]...