Search found 833 matches

by Joost Buijs
Mon May 27, 2019 11:07 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: bizarre behavior by Leela
Replies: 3
Views: 108

Re: bizarre behavior by Leela

Note the illegal e7d8 instead of the correct d7h3 Not to sure what Leela is smoking but it doesn't look good. position startpos moves e2e4 c7c5 g1f3 d7d6 d2d4 c5d4 f3d4 g8f6 f1d3 b8c6 d4c6 b7c6 e1g1 g7g6 c1g5 f8g7 b1c3 h7h6 g5e3 f6g4 d1d2 g4e3 d2e3 d8b6 e3b6 a7b6 a2a3 e7e6 a1b1 e8e7 c3e2 c8d7 c2c3 ...
by Joost Buijs
Sun May 26, 2019 5:33 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney May
Replies: 11
Views: 559

Re: On-line engine blitz tourney May

:Tourney Players: Round 9 of 9 : : Name Rating Score Perfrm Upset Results : ----------------- ------ ----- ------ ------ ------- : 28 +Spartacus [1470] 6.5 [1389] [ 68] +26w +22b -21w -25b -23w +29b +32w -31w -18b : 31 +EmblaTwo [1163] 6.0 [1363] [ 448] +33w +32b -26w +35b -29b +34w =30w +28b -19w ...
by Joost Buijs
Sat May 25, 2019 4:20 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

Maybe I only do check evasions above some depth. Say -6. I don't have repetition detection in QSearch. If most are captures then I think not many repetitions will occur or not? By the way with check evasions I get same problem with futility pruning in QSearch as in normal Search on depth = 1. For i...
by Joost Buijs
Sat May 25, 2019 5:51 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

I think the difference is due to the fact that you don't generate check-evasions, because check-evasions will contain non captures too. So you have to generate evasions when the king is in check. You have to do this in quiescence too, otherwise your quiescence will make very big errors. Do you have...
by Joost Buijs
Fri May 24, 2019 5:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

These are the counts I get per move at depth 4, maybe it helps. g2h3: 381 d5e6: 436 e5g6: 495 e5d7: 642 e5f7: 475 e2a6: 343 f3h3: 397 f3f6: 521 Maybe somebody else can verify these numbers. I think the difference is due to the fact that you don't generate check-evasions, because check-evasions will...
by Joost Buijs
Fri May 24, 2019 2:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

I guess you already know the bitboard value of say square e5 by heart. I remember h1 being 128. By the way when doing check evasion is it allowed to stand pat that is doing no moves when in check? I also don't understand futility pruning. Say at depth 1 it prunes a move that gives check while openi...
by Joost Buijs
Fri May 24, 2019 2:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

I get the same number as you : I'm happy to know that our numbers are the same. Henk is not generating check-evasions and that causes the difference. By the way is doing check evasions in QSearch an elo gain? Maybe I should implement them too if I have time. At this moment I don't call QSearch in n...
by Joost Buijs
Fri May 24, 2019 1:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

abulmo2 wrote:
Fri May 24, 2019 1:24 pm
I get the same number as you :
I'm happy to know that our numbers are the same. Henk is not generating check-evasions and that causes the difference.
by Joost Buijs
Fri May 24, 2019 1:20 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

You really have to generate check-evasions when the king is in check (blocking moves and king moves to get out of check) if you want to be correct. Unfortunately I have to modify my code if I want to do it your way (to check if the king is captured), so it is not straightforward to compare our numbe...
by Joost Buijs
Fri May 24, 2019 12:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: QSearch perft
Replies: 24
Views: 490

Re: QSearch perft

These are the counts I get per move at depth 4, maybe it helps. g2h3: 381 d5e6: 436 e5g6: 495 e5d7: 642 e5f7: 475 e2a6: 343 f3h3: 397 f3f6: 521 Maybe somebody else can verify these numbers. I think the difference is due to the fact that you don't generate check-evasions, because check-evasions will ...