An Algorithm for Automatically Updating a Forsyth-Edwards Notation String Without an Array Board Representation
원문 초록
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 useful when there are no existing array-based modules to represent a visual board as it can do without them entirely. We provide examples that demonstrate the correctness of the algorithm given a variety of positions involving castling, en passant and pawn promotion.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Vision Language Models are Biased
4Hammer: a board-game reinforcement learning environment for the hour long time frame
Playing Non-Embedded Card-Based Games with Reinforcement Learning
ZeroSumEval: An Extensible Framework For Scaling LLM Evaluation with Inter-Model Competition
Playing Hex and Counter Wargames using Reinforcement Learning and Recurrent Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.