The video game industry (VGI) faces significant challenges in today’s world. Game designers continually strive to create innovative scenarios that engage players and enhance their motivation to play. However, developing such scenarios is a complex task, and evaluating their difficulty during the design phase is equally challenging. In this paper, we focus on the Wumpus World game and propose a model for it using Coloured Petri Nets (CPNs). The proposed model enables designers to simulate various game scenarios and assess their difficulty levels without modifying the underlying structure by simply changing the tokens of the model. Since in most games, players need to switch between. Since, in most games, players must transition between different states to achieve their objectives, the mapping approach introduced here can also be applied to model and simulate other games.
Naghash Asadi,A , Pourjani,M and Mirsaeed Ghazi,A . (2025). Modeling of the Wumpus World to Evaluate the Difficulty Level of the Game using Coloured Petri Net. Journal of Algorithms and Computation, 57(2), 66-79. doi: 10.22059/jac.2025.403785.1241
MLA
Naghash Asadi,A , , Pourjani,M , and Mirsaeed Ghazi,A . "Modeling of the Wumpus World to Evaluate the Difficulty Level of the Game using Coloured Petri Net", Journal of Algorithms and Computation, 57, 2, 2025, 66-79. doi: 10.22059/jac.2025.403785.1241
HARVARD
Naghash Asadi A, Pourjani M, Mirsaeed Ghazi A. (2025). 'Modeling of the Wumpus World to Evaluate the Difficulty Level of the Game using Coloured Petri Net', Journal of Algorithms and Computation, 57(2), pp. 66-79. doi: 10.22059/jac.2025.403785.1241
CHICAGO
A Naghash Asadi, M Pourjani and A Mirsaeed Ghazi, "Modeling of the Wumpus World to Evaluate the Difficulty Level of the Game using Coloured Petri Net," Journal of Algorithms and Computation, 57 2 (2025): 66-79, doi: 10.22059/jac.2025.403785.1241
VANCOUVER
Naghash Asadi A, Pourjani M, Mirsaeed Ghazi A. Modeling of the Wumpus World to Evaluate the Difficulty Level of the Game using Coloured Petri Net. J. Algo. Comp.. 2025;57(2):66-79. doi: 10.22059/jac.2025.403785.1241