Search found 134 matches

by fabianVDW
Sat Jul 25, 2020 9:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: NNUE accessible explanation
Replies: 12
Views: 4948

Re: NNUE accessible explanation

I can chime in on two of the points and maybe provide a bit of a mathematical background, although I am unsure how much of this you know already. 1) If I want the NN to return an evaluation, which could be used in a traditional alphabeta search engine, how is this achieved most commonly? Do I have a...
by fabianVDW
Fri Jun 19, 2020 6:49 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: 80th Amateur Series Division 4
Replies: 14
Views: 2154

Re: 80th Amateur Series Division 4

Thanks for this tourney Graham! Fab overperformed pretty hard, but still almost managed to throw the lead away in the end :D
by fabianVDW
Fri Jun 12, 2020 5:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft speed and depth questions
Replies: 43
Views: 9672

Re: Perft speed and depth questions

Very interesting, thank you for the background information bob. Although, I think it is similar to telling your child that they should / shouldn't do something. Invariably they ignore good advice and have to learn the hard way rather than by their parents experience :D - I am sure I will look back ...
by fabianVDW
Fri Jun 12, 2020 2:59 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft speed and depth questions
Replies: 43
Views: 9672

Re: Perft speed and depth questions

According to your number it looks like the relative speed of perft with/without bulk counting depends on one's implementation. I definitely second this! If you do extra work on initializing extra info on your GameState struct when constructing it for instance, it won't hurt search performance at al...
by fabianVDW
Thu Jun 11, 2020 9:59 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft speed and depth questions
Replies: 43
Views: 9672

Re: Perft speed and depth questions

While correctly working code is most important, 14M nps seems a little on the slow side. Tinker is far from the fastest at perft, but it is about 95M nps on a 3.6GHz CPU. Move generation in Tinker is done with magic bitboards, BTW. 95M nps without bulk counting is very fast. 14 Mnps looks like a go...
by fabianVDW
Thu Jun 11, 2020 8:34 pm
Forum: Computer Chess Club: General Topics
Topic: Other fun mates
Replies: 103
Views: 22796

Re: Other fun mates

FabChess has a hard time on this one, needs 14 minutes to get it right on 4 threads info depth 1 seldepth 0 nodes 0 nps 0 hashfull 0 time 0 score cp 31 pv d5c4 info depth 2 seldepth 0 nodes 0 nps 0 hashfull 0 time 0 score cp 74 pv d5c4 g3g4 info depth 3 seldepth 0 nodes 0 nps 0 hashfull 0 time 0 sco...
by fabianVDW
Tue Jun 09, 2020 12:57 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: SRL june 9
Replies: 8
Views: 936

Re: SRL june 9

Thanks for testing :)
I will try to resolve the errors for the next version
by fabianVDW
Sun Jun 07, 2020 7:52 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: CEGT - rating lists June 07th 2020
Replies: 3
Views: 643

Re: CEGT - rating lists June 07th 2020

Thanks for having tested FabChess :) Very good results
by fabianVDW
Sun May 31, 2020 8:09 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: CEGT - rating lists May 31th 2020
Replies: 1
Views: 642

Re: CEGT - rating lists May 31th 2020

Thanks for testing FabChess, I'm already excited to see the results :)!