TalkChess.com

You described the knight move as Y shaped. You could also desribe it as T shaped.
Two steps orthogonally and then one step to each side.

Thank you for that explanation. May be I try to visualize that somehow. My diagram was created from the engine's point of view. While it is mostly just waiting or looping around in the observing force mode it gets all kinds of commands that just change some variables. Perhaps some member variables o...

Hi I am trying to understand the communication between Winboard and the chess engine a little better. See: Chess Engine Communication Protocol http://www.open-aurec.com/wbforum/WinBoard/engine-intf.html and: WinBoard/XBoard protocol state diagram https://www.chessprogramming.org/Chess_Engine_Communi...

This thread reminds me of an old Z80 assembler chess program 'Schachmatt' by Gerhard Scheuermann. It is a very fast mate solver that was published in the german computer magazine CHIP in 03/1984. It does not play chess but generates, makes, unmakes moves and looks for mates. The piece abbreviations ...

Just an untested idea: What if there is a dynamic array int killer_reliability[MAX_PLY] that measures distances in the search tree and is initialised in the root with killer_reliability[0] = 100 and in each node (at ply) when we make the first move set killer_reliability[ply + 1] = killer_reliabilit...

Here is a little piece of history that partly matches this topic: Search found 1 match: +Bitboard +methods +compared with author Harald: http://talkchess.com/forum3/viewtopic.php?f=7&t=16002&p=140111&hilit=Bitboard+methods+compared#p140111 Maybe I find an old zipped source of the old test engine Ele...

What do you mean with opening position (in the image)
[D]3rqknr/4bpp1/4bpp1/1PP1npp1/1PPN1pp1/1PPB4/1PPB4/RNKQR3 w - - ?
The games listed in your post have other and different starting positions.

This is pointless. Just clutters the code for no reason.

The point is that you can choose which portions of your program you want to debug today without making the whole program slower.

If you want to test only parts of your code then you can do things like this: In an header like basics.h // Which tests should be performed #ifdef _DEBUG #define ASSERT_BASICS(c,t) { if ( !(c) ) throw (t); } #define ASSERT_PRINCIPAL_VARIATION(c,t) { if ...

My guess for the evaluation is:
First do 4 individual static evaluations, one for each player and his pieces.
Then each player who has the right to move tries to maximize the term
his_evaluation - max(the other evaluations)