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

by   Azlan Iqbal, et al.

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.



There are no comments yet.


page 1

page 2

page 3

page 4


On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

We characterize those strings whose suffix arrays are based on arithmeti...

A Simple Algorithm for Computing the Document Array

We present a simple algorithm for computing the document array given the...

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string C is a cover ...

String-to-String Interpretations with Polynomial-Size Output

String-to-string MSO interpretations are like Courcelle's MSO transducti...

An Analysis into the Performance and Memory Usage of MATLAB Strings

MATLAB is a mathematical computing environment used by many engineers, m...

Scout Algorithm For Fast Substring Matching

Exact substring matching is a common task in many software applications....

Development of Dynamic Local Area Network (LAN) Based Mock Board Examination System

Purpose-Mock board exam is necessary to identify if the students are rea...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.