Fractal Analysis of Stealthy Pathfinding Aesthetics
Author(s) -
Ron Coleman
Publication year - 2008
Publication title -
international journal of computer games technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.248
H-Index - 19
eISSN - 1687-7055
pISSN - 1687-7047
DOI - 10.1155/2009/670459
Subject(s) - pathfinding , fractal , openness to experience , computer science , value (mathematics) , artificial intelligence , mathematics , psychology , theoretical computer science , machine learning , shortest path problem , mathematical analysis , social psychology , graph
This paper uses a fractal model to analyze aesthetic values of a new class of obstacle-prone or “stealthy” pathfinding which seeks to avoid detection, exposure, openness, and so forth in videogames. This study is important since in general the artificial intelligence literature has given relatively little attention to aesthetic outcomes in pathfinding. The data we report, according to the fractal model, suggests that stealthy paths are statistically significantly unique in relative aesthetic value when compared to control paths. We show furthermore that paths generated with different stealth regimes are also statistically significantly unique. These conclusions are supported by statistical analysis of model results on experimental trials involving pathfinding in randomly generated, multiroom virtual worlds
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom