TalkChess.com

MoveOverhead is very important. I implemented it. UCI doesn't have Move Overhead. So I looked at SF. With 500ms Sapeli shouldn't lose any games (on time). option name UCI_Chess960 type check default false option name UCI_Kingofthehill type check default false option name Level type spin default 100 ...

Somebody told that int is a much faster way to generate moves. So I tested int movegen in Sapeli: 6 bits for from/to + 4 bits for type. Fits in int. What are you comparing to? int (copy/make): Board (just make): Are you comparing two move representations, one of which fits in an int and the other m...

I think best is not to focus on results. Most important is maintainable code. One spends most of the time in refactoring and debugging code. So best is to make that easy. Results. Who cares about results? We are not Stockfish or LCzero testers. Nobody cares about our stupid engines. I focus on sloc...

Somebody told that int is a much faster way to generate moves. So I tested int movegen in Sapeli: 6 bits for from/to + 4 bits for type. Fits in int. And produces correct perft. The results. It's actually much slower. Yes it's stronger in search. But it doesn't generate any faster. int (copy/make): 1...

----------------------------------------------------------- My engine Sapeli 1.93. https://github.com/SamuraiDangyo/Sapeli :( ------------------------------------------------------------ Sorry but your link is wrong or there is a problem with github Best regards Hmmm it seems the Sapeli repo either...

My engine Sapeli 1.93.
See the games here (With small book): https://lichess.org/@/SapeliEngine
It has typical materialistic style: https://lichess.org/kT9ahinb

When engines get better and better then draw rate should increase every season. As chess is draw. Lc0 is put into tactical positions it wouldn't go itself. A little bit unfair. I think it would be better to give both own books and let them play itself. I haven't watched any (I'm too busy) TCEC so I ...

New version of LastEmperor (C -> C++): https://github.com/SamuraiDangyo/LastEmperor lastemperor -hash=1024 -fen="r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq -" -perft=7 [ r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - ] Depth Nodes Mnps Time 0 1 0 0 1 48 0 0 2 2,...

The real question is there a way to tune without massive computation? Take the cheapest pinebook and tune some engine in 6 hours?

Dangerous that you have to write your own code? Can one take SF board presentation + NNUE. Basically all but the holy search? Just implement own AB-search. Is that ok?