Abstract
One of the fundamental topics in intelligent game playing is the problem of efficient game representation. In board games a square-by-square description of the board in the form of a linear vector is often applied. Usually the value of each element defines the presence of a (particular) piece and a sign denotes the side to which the piece belongs, with a value of zero representing an empty square. Such an approach, although well suited for computer representation and feasible from the computational point of view, is not necessarily the optimal one in terms of capturing specific game features. These features are often reflected in the form of 2D patterns, rather than linear vectors. Intuitively, when talking about efficient game representations, the ones accounting for spatial, two-dimensional relations should also deserve attention.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
MaĆdziuk, J. (2010). Game Representation. In: Knowledge-Free and Learning-Based Methods in Intelligent Game Playing. Studies in Computational Intelligence, vol 276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11678-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-11678-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11677-3
Online ISBN: 978-3-642-11678-0
eBook Packages: EngineeringEngineering (R0)