TalkChess.com

Perhaps it is a draw, perhaps a win, but it is white to move. Does any engine try immediate b5?

To avoid problems with spooning a non-free engine, I might be tempted to create a very basic bitboard engine. Interested?

What I do is precisely about planning. My private engine has two competing scores for piece/square tables (one symmetric, one slanted towards kingside), and two mobility scores (one linear, one non-linear). The algorithm I described calculates the difference between two scores and tries to decide wh...

I have found a working algorithm. I'm not claiming that it is any better than real neural network, and it is inefficient form traditional point of view, as the engine maintains twice as many piece/square tables. However, it does not cause too big a slowdown within a traditional evaluation function, ...

I vaguely recall Tord Romastad's post on fishcooking list where he explained that overvaluing drawn positions is actually good for modern selective search. Getting "good drawn position" might indicate that there is some conversion to superior ending along the way, but it has been pruned one way or t...

Tested that, probably with some depth limit, but failed narrowly (which does not mean anything for Your engine, the rating gap implies I must have failed on several techniques that work for You). IIRC Andscacs might be using it. The real fun comes when you print all the positions when quiescence sea...

Michael, I will be glad if you prove me wrong. But even then I would search for ways to reduce game length. You want to feed transposition table with additional information, trusting that it will help to shape the final search. The idea looks good, as long as this information has a chance to be acce...

I'm afraid this algorithm would search too many moves irrelevent for the second search to be competitive. But when I'm analysing positions under Arena, I often do the following: short search, taking back, longer search. Some tactics are found faster that way. I'd suggest the following: try that appr...

A nameless entity, still weaker than Rodent (I'll release only if it becomes clearly stronger), got this amusing draw after a ridiculous pawn sack in the early middlegame: [Event "Impersontor2019-01(2)"] [Site "LAPTOP"] [Date "2019.01.09"] [Round "18"] [White "Rodentiii"] [Black "Impersonator"] [Res...

I add noise in eval, pseudocode follows:
This way random component of evaluation is always the same for the position, centered around zero, different in each game and does not pollute search code.