Computational assessment of sparsity in board games

Research output: Contribution to conferencePaper

Abstract

Board games like chess, checkers and go all have squares or points on a matrix-like board and pieces that occupy them throughout the course of a game. The author proposes an evaluation function for the concept of sparsity in such games. Sparsity refers to the general lack of concentration of pieces on the board and is inversely proportional to the perceived density. Evaluating sparsity is important from a visual perspective and useful for computational aesthetics purposes since dense piece configurations can be confusing and less pleasing to the eye. The evaluation function was designed with aesthetics in mind and comparisons with possible alternatives were done, suggesting its advantages. Experiments involving over a thousand chess positions were carried out to validate the function with promising results. An alternative method was also tested using the same data and it was found that evaluating sparsity is not as straightforward as it may seem. The work presented in this paper could therefore be useful to other researchers interested in a viable computational approach to the concept in board games or other areas.

Original languageEnglish
Pages29-33
Number of pages5
Publication statusPublished - 01 Jan 2008
Event12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008 - Louisville, KY, United States
Duration: 30 Jul 200802 Aug 2008

Other

Other12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008
CountryUnited States
CityLouisville, KY
Period30/07/0802/08/08

Fingerprint

Function evaluation
Experiments

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Human-Computer Interaction
  • Software

Cite this

Mohamed Iqbal, M. A., & Yaacob, M. (2008). Computational assessment of sparsity in board games. 29-33. Paper presented at 12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008, Louisville, KY, United States.
Mohamed Iqbal, Mohammed Azlan ; Yaacob, Mashkuri. / Computational assessment of sparsity in board games. Paper presented at 12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008, Louisville, KY, United States.5 p.
@conference{c9a4f6a3d9a64d57a93bd17b00d19635,
title = "Computational assessment of sparsity in board games",
abstract = "Board games like chess, checkers and go all have squares or points on a matrix-like board and pieces that occupy them throughout the course of a game. The author proposes an evaluation function for the concept of sparsity in such games. Sparsity refers to the general lack of concentration of pieces on the board and is inversely proportional to the perceived density. Evaluating sparsity is important from a visual perspective and useful for computational aesthetics purposes since dense piece configurations can be confusing and less pleasing to the eye. The evaluation function was designed with aesthetics in mind and comparisons with possible alternatives were done, suggesting its advantages. Experiments involving over a thousand chess positions were carried out to validate the function with promising results. An alternative method was also tested using the same data and it was found that evaluating sparsity is not as straightforward as it may seem. The work presented in this paper could therefore be useful to other researchers interested in a viable computational approach to the concept in board games or other areas.",
author = "{Mohamed Iqbal}, {Mohammed Azlan} and Mashkuri Yaacob",
year = "2008",
month = "1",
day = "1",
language = "English",
pages = "29--33",
note = "12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008 ; Conference date: 30-07-2008 Through 02-08-2008",

}

Mohamed Iqbal, MA & Yaacob, M 2008, 'Computational assessment of sparsity in board games' Paper presented at 12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008, Louisville, KY, United States, 30/07/08 - 02/08/08, pp. 29-33.

Computational assessment of sparsity in board games. / Mohamed Iqbal, Mohammed Azlan; Yaacob, Mashkuri.

2008. 29-33 Paper presented at 12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008, Louisville, KY, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Computational assessment of sparsity in board games

AU - Mohamed Iqbal, Mohammed Azlan

AU - Yaacob, Mashkuri

PY - 2008/1/1

Y1 - 2008/1/1

N2 - Board games like chess, checkers and go all have squares or points on a matrix-like board and pieces that occupy them throughout the course of a game. The author proposes an evaluation function for the concept of sparsity in such games. Sparsity refers to the general lack of concentration of pieces on the board and is inversely proportional to the perceived density. Evaluating sparsity is important from a visual perspective and useful for computational aesthetics purposes since dense piece configurations can be confusing and less pleasing to the eye. The evaluation function was designed with aesthetics in mind and comparisons with possible alternatives were done, suggesting its advantages. Experiments involving over a thousand chess positions were carried out to validate the function with promising results. An alternative method was also tested using the same data and it was found that evaluating sparsity is not as straightforward as it may seem. The work presented in this paper could therefore be useful to other researchers interested in a viable computational approach to the concept in board games or other areas.

AB - Board games like chess, checkers and go all have squares or points on a matrix-like board and pieces that occupy them throughout the course of a game. The author proposes an evaluation function for the concept of sparsity in such games. Sparsity refers to the general lack of concentration of pieces on the board and is inversely proportional to the perceived density. Evaluating sparsity is important from a visual perspective and useful for computational aesthetics purposes since dense piece configurations can be confusing and less pleasing to the eye. The evaluation function was designed with aesthetics in mind and comparisons with possible alternatives were done, suggesting its advantages. Experiments involving over a thousand chess positions were carried out to validate the function with promising results. An alternative method was also tested using the same data and it was found that evaluating sparsity is not as straightforward as it may seem. The work presented in this paper could therefore be useful to other researchers interested in a viable computational approach to the concept in board games or other areas.

UR - http://www.scopus.com/inward/record.url?scp=84866563856&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866563856&partnerID=8YFLogxK

M3 - Paper

SP - 29

EP - 33

ER -

Mohamed Iqbal MA, Yaacob M. Computational assessment of sparsity in board games. 2008. Paper presented at 12th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, CGAMES 2008, Louisville, KY, United States.