←back to thread

How to Build a Chess Engine and Fail

(obrhubr.org)
131 points xlinux | 2 comments | 19 Nov 24 06:38 UTC | HN request time: 0.43s | source
Show context
zelphirkalt ◴[19 Nov 24 16:42 UTC] No.42185402[source]▶
All this I guess comes after laying the ground work, like implementing a bitboard representation or something else, and implementing the logic for being able to tell, whether a move is valid or invalid. That in itself is already a lot of work. iiuc the idea here is "merely" writing the engine, and take everything else as a given.
replies(1): >>42185441 #
obrhubr ◴[19 Nov 24 16:46 UTC] No.42185441[source]▶
The game’s implementation itself was furnished with the competition by Sebastian Lague. I completely agree that writing the move logic, validation, etc… is a difficult undertaking especially when it comes to optimisation which is what allows the bots built on top to perform well.
replies(2): >>42186091 #>>42186112 #
james_marks ◴[19 Nov 24 17:40 UTC] No.42186112[source]▶
Is there not an open standard for this? I glanced and didn’t see anything, but seems crazy every chess project would need to define the game.
replies(1): >>42186374 #
1. qsort ◴[19 Nov 24 18:02 UTC] No.42186374[source]▶
There are open components for generic purposes, e.g. draw the board given a PGN, show the moves, check if moves are legal and so on, but they aren't suitable for engine internals. There are several tricks with bits to store positions, hashing schemes for transposition tables and the likes that are key to unlock the maximum performance possible, and they are usually tied to the engine implementation.
replies(1): >>42204931 #
2. james_marks ◴[21 Nov 24 15:03 UTC] No.42204931[source]▶
Interesting, that makes sense.

Given that, I think what I’m imagining is a PGN linter & renderer.