Search found 77 matches

by Ratosh
Sun Dec 30, 2018 2:09 am
Forum: Computer Chess Club: Tournaments and Matches
Topic: 72nd Amateur Series Division 3
Replies: 13
Views: 2135

Re: 72nd Amateur Series Division 3

Thanks for the tournament Graham, congrats Ronald!
by Ratosh
Sun Dec 23, 2018 2:56 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 9021

Re: fast(er) movegen

Great info Ronald, i expected a bigger influence on slower move generation.

Thanks
by Ratosh
Fri Dec 21, 2018 12:02 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: new axolotl!
Replies: 10
Views: 1907

Re: new axolotl!

Hey Luis,

You can get to 3000 CCRL running on a JVM. Chess22k is written in Java and is about 3100 CCRL, Pirarucu is written in Kotlin and is about 2950 CCRL. My engine (Pirarucu) does not have a fast move generator, but has a decent search speed.
by Ratosh
Thu Dec 20, 2018 11:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Insurance thread
Replies: 7
Views: 1421

Re: Insurance thread

Pirarucu implements the "too lazy" smp and seems to scale really well.
by Ratosh
Sat Dec 15, 2018 1:13 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: sprt question
Replies: 3
Views: 1602

Re: sprt question

Hi,

I've a modification on his OpenBench on my fork that i can input the minimum number of games i want to use in a test, i use it to make regression tests with a fixed number of games.

This is my modifications: Change

PS.: You'll need to patch your database to create the mingames column.
by Ratosh
Tue Dec 11, 2018 10:02 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Quantifying progress && Naked WAC
Replies: 8
Views: 1669

Re: Quantifying progress && Naked WAC

Hi Louis, If you wanna test the base strength of your engine you can use some really low rated engine on CCRL or any other rating list, but the best way to measure progress is using SPRT. I use OpenBench by Andrew Grant, it has integration with GitHub branches, so you can test if a branch is "better...
by Ratosh
Tue Dec 11, 2018 11:55 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 9021

Re: fast(er) movegen

Michael Sherwin wrote:
Tue Dec 11, 2018 5:41 am
Ratosh wrote:
Mon Dec 10, 2018 9:50 pm
Oh, i assumed it since most top engines use bitboard. What would be the reason why they would chose it over other options?
if(!(wPassed[sq] & bPawns)) score += PASSED_PAWN_BONUS;
Thank you.
by Ratosh
Mon Dec 10, 2018 11:02 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 9021

Re: fast(er) movegen

From GitHub pricing page: "GitHub is free to use for public and open source projects."
by Ratosh
Mon Dec 10, 2018 9:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 9021

Re: fast(er) movegen

Oh, i assumed it since most top engines use bitboard. What would be the reason why they would chose it over other options?
by Ratosh
Mon Dec 10, 2018 7:58 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 9021

Re: fast(er) movegen

HGM's move generation on qperft is a good reference for speed. If you want to change your board representation there is no doubt that bitboard representation is the fastest.