Search found 135 matches

by Patrice Duhamel
Sat Jun 08, 2013 8:59 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft search speed bottleneck
Replies: 76
Views: 7885

Re: Perft search speed bottleneck

1) store move with an integer. 2) lower 12 bits for to/from square. 3) next 3 bits for promote type - if any; or it means not a promotion move. Komodo has minor other uses for these 3 bits; pawn push x2 ? 4) remaining 1 bit of lower 16 bits - unused; or for later use to set checking moves when info...
by Patrice Duhamel
Fri May 31, 2013 4:31 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Win 7 GetTickCount() weirdness
Replies: 13
Views: 2874

Re: Win 7 GetTickCount() weirdness

I'm using QueryPerformanceCounter() but I will change to GetTickCount() because I read it can cause problems on multi cores machines.

But I never see problems with GetTickCount() or QueryPerformanceCounter().
by Patrice Duhamel
Wed May 29, 2013 6:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question about PVS and nodes type
Replies: 5
Views: 1964

Re: Question about PVS and nodes type

I understand, I thought PVS code need to be different at PV and non PV nodes, but I must have done something wrong when testing. Then you have "cut nodes" and "all nodes." ... I'm using only 2 types "PV nodes" and "non PV nodes", to use IID only at PV nodes, and disable null moves, LMR, and prunning...
by Patrice Duhamel
Tue May 28, 2013 6:47 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question about PVS and nodes type
Replies: 5
Views: 1964

Re: Question about PVS and nodes type

So there is no need for a special case in non PV nodes ?
Except choosing the right node type when calling the search function for the first move.
by Patrice Duhamel
Tue May 28, 2013 4:36 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question about PVS and nodes type
Replies: 5
Views: 1964

Question about PVS and nodes type

I'm not sure my code for PVS is correct. In the PVS, we search the first move with a full window, then we use a null window for other moves and research if it fails... But what to do at different nodes types ? The full search for the first move must be done only at PV nodes ? pseudo code : if ((...