TalkChess.com

I'm here to shamelessly advertise my engine Teki: https://github.com/Mk-Chan/Teki

It is MIT based (the lc0nn branch is GPL) and is meant to be a simple bitboard engine. Do take a look at the code to see if it suits you and feel free to *spoon* it.

So I see the problem being that in order to tell that the perpetual is still available at any depth down the search tree, you have to actually search for the perpetual again. Reason being situations where the other side can introduce a potential (or actual) check blocker (for example if white had a ...

I think this is the first project I have looked over that used Open MP to do the SMP for a chess search study: https://github.com/hennimohammed/parallel_chess_engine I had done it myself for perft but it didn't seem to scale as well as making a thread pool myself and doing it. I had figured there w...

Check out Teki:

https://github.com/Mk-Chan/Teki

It uses the classical bitboard approach (non-magic/rotated).

Congratulations to Alberto Alonso Ruibal (Carballo). :) The support for this broadcast was disappointing. I'd hoped to see more of the engine authors visiting. I'm sure that Ratosh (Pirarucu author) must have felt lonely at times. Hey Graham, sorry to hear about the poor turnout of authors (includi...

At the moment my chessengine participates in the TCEC tournament which uses a machine that has 44(!) cores. I was wondering what would be the best approach on how to use these cores effectively using lazy SMP. At the moment half of the threads search the actual depth and the other half searches at ...

furthermore, if the answer is no, I will do what I want and break the UCI spec. Great idea if you want to infuriate testers because effectively, your engine will be stealing computing power from your opponent during his thinking time. In CCRL, pondering is off because both engines run on the same m...

I'm trying to implement pondering, without having to deal with all of the ponderhit, send bestmove on stop, ... bs that is baked into the UCI spec. Here is a sample that I would like to follow --> position startpos --> go wtime 10000 btime 10000 <-- info depth 1 ... <-- .... <-- bestmove e2e4 // NO...

https://s33.postimg.cc/6l2x3uhf3/Teki2-4040.png Games: PGN Test setup: details CCRL 40/40 Rating List - Custom engine selection 857095 games played by 2205 programs, run by 21 testers Ponder off, General books (up to 12 moves), 3-4-5 piece EGTB Time control: Equivalent to 40 moves in 40 minutes on ...

One approach would be to use a traditional searcher and a NN for the evaluation function. This won't be high performance since the NN will have to be evaluated frequently at runtime. But it would suffice for an 1800 level engine. I will caution though as others have said here that building even a m...