Search found 776 matches

by elcabesa
Fri Mar 15, 2019 10:43 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: CPW bitscan with reset could someone explain this line?
Replies: 9
Views: 379

Re: CPW bitscan with reset could someone explain this line?

I understand that it confuse the compiler about keeping the data in cpu register instead that in ram.
Having them in register should be faster
by elcabesa
Mon Feb 18, 2019 3:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On failing high and finding mates
Replies: 14
Views: 914

Re: On failing high and finding mates

It's not correct. But I don't think this is a very big problem.
You'll get only some glitch with some gui when looking the interface.
by elcabesa
Sun Feb 17, 2019 9:47 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On failing high and finding mates
Replies: 14
Views: 914

Re: On failing high and finding mates

I am not sure about your exact problem. An "info" line containing "lowerbound" is not a PV, so there is no need to expect a mate score in it. Maybe I somehow missed your point? in his root search after the first move has been searched it print the UCI output with the word lowerbound, then after the...
by elcabesa
Sun Feb 17, 2019 4:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On failing high and finding mates
Replies: 14
Views: 914

Re: On failing high and finding mates

in your search futility pruning and history pruning ends with a break; instead of continue;. this is one of the reason why some moves are skipped because sometimes in the search all the non capture moves are skipped even if they are good or check.
by elcabesa
Sat Feb 16, 2019 9:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On failing high and finding mates
Replies: 14
Views: 914

Re: On failing high and finding mates

another strange thing is that your movesort give sometimes some duplicates moves, if you look at stndard output you can see that a lot of times in startpos your engine search 22, 23 moves in root. This is because for killers you don't check that a move shall not be equal to a previous move , for exa...
by elcabesa
Sat Feb 16, 2019 3:32 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On failing high and finding mates
Replies: 14
Views: 914

Re: On failing high and finding mates

it looks to me you have some kind of strange, but probably easy to find, BUG in your search. it looks to me that you are returning the real PV in your search and I would assume that in my analysis. at depth 30 your engine report the following PV with evaluation +30: info depth 30 seldepth 56 score c...
by elcabesa
Mon Feb 11, 2019 4:16 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: unit testing polyglot probe code....
Replies: 7
Views: 719

Re: unit testing polyglot probe code....

Thank you Peter, I'll try now to test promotions moves... even if they seems to not be present in my book
by elcabesa
Wed Feb 06, 2019 3:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: unit testing polyglot probe code....
Replies: 7
Views: 719

Re: unit testing polyglot probe code....

I'm not trying to calculate the key, probably I'll check it too sooner or later. I was asking if someone known some famous and sound opening with en passant or promotion.

Probably the author of perfect2017.bin will be the best source of info
by elcabesa
Wed Feb 06, 2019 1:54 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: unit testing polyglot probe code....
Replies: 7
Views: 719

unit testing polyglot probe code....

I'm debugging and testing vajolet polyglot probe code and I'm trying to test if the en passant and promotion code works. I'm using perfect2017.bin as opening book. do you know some opening lines containing promotion in the early phases? do you know some opening lines containing en passant moves in t...