TalkChess.com

Thanks for the tournament Graham, congrats Ronald!

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

Thanks

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.

Pirarucu implements the "too lazy" smp and seems to scale really well.

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.

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...

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.

From GitHub pricing page: "GitHub is free to use for public and open source projects."

Oh, i assumed it since most top engines use bitboard. What would be the reason why they would chose it over other options?

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.