Search found 286 matches

by xmas79
Sun Mar 19, 2017 8:56 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: High branching factor when mate score is found
Replies: 15
Views: 3683

Re: High branching factor when mate score is found

I'm not allowed to edit my own post anymore. Adding more info here: This is the main thread: http://www.talkchess.com/forum/viewtopic.php?t=48274 This is my first debug analysis: http://www.talkchess.com/forum/viewtopic.php?p=525210#525210 This is my last comment on the analysis: http://www.talkches...
by xmas79
Sun Mar 19, 2017 7:18 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: High branching factor when mate score is found
Replies: 15
Views: 3683

Re: High branching factor when mate score is found

Ok, this may or not be helpful. But Myrddin has always had a similar problem, or at least a problem that looks similar. Sometimes when it reports a mate score, on a subsequent ply it will fail low multiple times and then report a silly mate score like "Mate in 51". Your post led me to investigate t...
by xmas79
Mon Apr 25, 2016 5:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hashtable aging
Replies: 8
Views: 2469

Re: Hashtable aging

Dear all, up to now I have just been clearing my hashtable before each search which is obviously losing all the information gained during the last search. The chess programming wiki isn't very clear on how hashtable aging should be done. I'm thinking of adding an "accessed" flag to my hashtable ent...
by xmas79
Mon Apr 25, 2016 10:24 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(7) challenge position #4
Replies: 6
Views: 1301

Re: Perft(7) challenge position #4.

Hello Steven: Divided perft(7) of that position by JetChess 1.0.0.0: rnbqk1nr/p1pp1ppp/1p6/2b1p1B1/8/1QPP4/PP2PPPP/RN2KBNR b KQkq - 2 4 1 qd8-e7 1492445476 2 qd8-f6 1992746647 3 qd8*g5 1421478416 4 bc5-b4 1117769244 5 bc5-a3 1150495631 6 bc5-d4 1031537710 7 bc5-e3 969283318 8 bc5*f2 83974980 9 bc5-...
by xmas79
Mon Apr 11, 2016 5:46 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Another perft(7) challenge position
Replies: 21
Views: 3244

Re: Another perft(7) challenge position

NGN says:

Code: Select all

fen rnbq1b1r/ppppkppp/4pn2/8/1Q6/2PP4/PP2PPPP/RNB1KBNR b KQ - 2 4
OK
perftfastmt 7
Time elapsed: 11.13300 seconds
Total leaf nodes: 3016055832
270.9M LNPS
by xmas79
Thu Apr 07, 2016 8:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A perft(7) challenge position
Replies: 22
Views: 5210

Re: A perft(7) challenge position

My program NGN says:

Code: Select all

fen rnb1kbnr/pp1pp1pp/1qp2p2/8/Q1P5/N7/PP1PPPPP/1RB1KBNR b Kkq - 2 4
OK

perftfastmt 7
Time elapsed: 51.66800 seconds
Total leaf nodes: 14794751816
286.3M LNPS
by xmas79
Sat Nov 28, 2015 10:09 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Auriga - distributed and collaborative Perft
Replies: 12
Views: 1939

Re: Auriga - distributed and collaborative Perft

Hmm, I just helped to finish 7E4CD3B1-E2A6-18F0-56A1-56717265711E, but the resulting count is wrong unfortunately... It should be 614,975,507,497 (gperft computes this on 1 thread in 94 seconds. My engine NGN says: Time elapsed: 2232.60600 seconds Total leaf nodes: 614975507497 275.5M LNPS counting...
by xmas79
Mon Nov 09, 2015 6:42 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Cleanest way to exit processes?
Replies: 10
Views: 1628

Re: Cleanest way to exit processes?

Maybe I could try with some bugged engine, just to see what happens in any condition... if someone could suggest one ;) I don't think you'll ever find an engine bugged more than int main() { while(1); }; Wow... you're a genius! It was that simple! ;) Ok, with this mini-max bug...
by xmas79
Mon Nov 09, 2015 6:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Cleanest way to exit processes?
Replies: 10
Views: 1628

Re: Cleanest way to exit processes?

stegemma wrote:Wow... you're a genius!
I agree :)

Wait! I have one more buggy engine: take yours and in main search write:

Code: Select all

int search(int alpha, int beta, ......)
{
    ...
    while(1);
    ...
}