An Algorithm for Automatically Updating a Forsyth-Edwards Notation String Without an Array Board Representation
Azlan Iqbal

TL;DR
This paper introduces an algorithm that updates FEN strings directly after chess moves without using array-based board representations, enabling efficient integration with software lacking such modules.
Contribution
The novel algorithm updates FEN strings directly, eliminating the need for array conversions, suitable for software without array-based board representations.
Findings
Algorithm correctly updates FEN after various moves
Works without array-based board representations
Immediate export of updated FEN strings
Abstract
We present an algorithm that correctly updates the Forsyth-Edwards Notation (FEN) chessboard character string after any move is made without the need for an intermediary array representation of the board. In particular, this relates to software that have to do with chess, certain chess variants and possibly even similar board games with comparable position representation. Even when performance may be equal or inferior to using arrays, the algorithm still provides an accurate and viable alternative to accomplishing the same thing, or when there may be a need for additional or side processing in conjunction with arrays. Furthermore, the end result (i.e. an updated FEN string) is immediately ready for export to any other internal module or external program, unlike with an intermediary array which needs to be first converted into a FEN string for export purposes. The algorithm is especially…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
