title: Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð¾Ð±ÑÑÐ°ÑÑÐµÐ³Ð¾ ÑÑÐµÐ½Ð°Ð¶ÐµÑÐ° Ð´Ð»Ñ ÑÐµÑÐµÐ½Ð¸Ñ Ð»Ð¾Ð³Ð¸ÑÐµÑÐºÐ¾Ð¹ Ð·Ð°Ð´Ð°ÑÐ¸ Ð¡Ð°Ð¿ÐµÑÐ° Ð² AnyLogic
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Development of an eduactional game for Minesweeper problem logical solving in AnyLogic
Creators: name: ÐÐ¸Ð½Ð´ÑÐ±Ð°ÐµÐ²Ð°, Ð ÐµÐ·ÐµÐ´Ð°
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2020
Subjects: Ð±Ð¸Ð½Ð°ÑÐ½Ð°Ñ ÑÐµÑÐ°ÑÑÐ°Ñ Ð´Ð¸Ð°Ð³ÑÐ°Ð¼Ð¼Ð°
Ð·Ð°Ð´Ð°ÑÐ° ÑÐ°Ð¿ÐµÑÐ°
Ð»Ð¾Ð³Ð¸ÐºÐ° Ð²ÑÑÐºÐ°Ð·ÑÐ²Ð°Ð½Ð¸Ð¹
Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ Ð² Ð¾Ð³ÑÐ°Ð½Ð¸ÑÐµÐ½Ð¸ÑÑ
Ð¼Ð¾Ð´ÐµÐ»Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ Ð² AnyLogic
ÑÑÐµÐ½Ð°Ð¶ÐµÑ
binary decision diagram
minesweeper
propositional calculus
AnyLogic modeling
constraint programming
educational game

description: Ð Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÐµ Ð¸Ð·Ð»Ð¾Ð¶ÐµÐ½ Ð¿Ð¾Ð´ÑÐ¾Ð´ Ðº ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐµ Ð¾Ð±ÑÑÐ°ÑÑÐµÐ³Ð¾ ÑÑÐµÐ½Ð°Ð¶ÐµÑÐ° Ð´Ð»Ñ ÑÑÑÐ´ÐµÐ½ÑÐ¾Ð², Ð¸Ð·ÑÑÐ°ÑÑÐ¸Ñ Ð¼Ð°ÑÐµÐ¼Ð°ÑÐ¸ÑÐµÑÐºÑÑ Ð»Ð¾Ð³Ð¸ÐºÑ Ð¸ Ð¸ÑÐ¿ÑÑÑÐ²Ð°ÑÑÐ¸Ñ ÑÑÑÐ´Ð½Ð¾ÑÑÐ¸ Ñ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸ÐµÐ¼ Ð±Ð¸Ð½Ð°ÑÐ½ÑÑ ÑÐµÑÐ°ÑÑÐ¸Ñ Ð´Ð¸Ð°Ð³ÑÐ°Ð¼Ð¼. ÐÑÐ½Ð¾Ð²Ð½ÑÐ¼ Ð¼ÐµÑÐ¾Ð´Ð¾Ð¼ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸Ñ ÑÑÐµÐ½Ð°Ð¶ÐµÑÐ° ÑÐ²Ð»ÑÐµÑÑÑ Ð°Ð³ÐµÐ½Ñ, ÐºÐ¾ÑÐ¾ÑÑÐ¹ Ð¿Ð¾ÑÑÐµÐ´ÑÑÐ²Ð¾Ð¼ Ð»Ð¾Ð³Ð¸ÑÐµÑÐºÐ¾Ð³Ð¾ Ð²ÑÐ²Ð¾Ð´Ð° ÑÐµÑÐ°ÐµÑ Ð·Ð°Ð´Ð°ÑÑ Â«Ð¡Ð°Ð¿ÐµÑÂ» ÐºÐ°Ðº Ð·Ð°Ð´Ð°ÑÑ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð² Ð¾Ð³ÑÐ°Ð½Ð¸ÑÐµÐ½Ð¸ÑÑ. ÐÐ»Ñ ÑÑÐ¾Ð³Ð¾ Ð¿ÑÐµÐ´Ð²Ð°ÑÐ¸ÑÐµÐ»ÑÐ½Ð¾ Ð²ÑÐµ Ð¾Ð³ÑÐ°Ð½Ð¸ÑÐµÐ½Ð¸Ñ Ð² Ð·Ð°Ð´Ð°ÑÐµ Â«Ð¡Ð°Ð¿ÐµÑÂ» Ð±ÑÐ»Ð¸ ÑÐ¾ÑÐ¼Ð°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ñ Ñ Ð¿Ð¾Ð¼Ð¾ÑÑÑ Ð»Ð¾Ð³Ð¸ÐºÐ¸ Ð²ÑÑÐºÐ°Ð·ÑÐ²Ð°Ð½Ð¸Ð¹, Ð¸ Ð²ÑÐµ Ð±ÑÐ»ÐµÐ²Ñ ÑÑÐ½ÐºÑÐ¸Ð¸ Ð¿ÑÐµÐ´ÑÑÐ°Ð²Ð»ÐµÐ½Ñ Ð² Ð²Ð¸Ð´Ðµ Ð±Ð¸Ð½Ð°ÑÐ½Ð¾Ð¹ ÑÐµÑÐ°ÑÑÐµÐ¹ Ð´Ð¸Ð°Ð³ÑÐ°Ð¼Ð¼Ñ. ÐÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð°Ñ ÑÐ°ÑÑÑ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ð° Ð² ÑÑÐµÐ´Ðµ Ð¼Ð¾Ð´ÐµÐ»Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ AnyLogic, Ð¸ Ð² ÑÐ²ÑÐ·Ð¸ Ñ ÑÑÐ¸Ð¼ Ð½Ð°Ð¿Ð¸ÑÐ°Ð½Ð° Ð¿Ð¾Ð»Ð½Ð¾ÑÑÑÑ Ð½Ð° ÑÐ·ÑÐºÐµ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Java. ÐÐ»Ñ Ð¿ÑÐµÐ´ÑÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð² Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ðµ Ð±ÑÐ»ÐµÐ²ÑÑ ÑÑÐ½ÐºÑÐ¸Ð¹ Ð² Ð²Ð¸Ð´Ðµ Ð±Ð¸Ð½Ð°ÑÐ½ÑÑ ÑÐµÑÐ°ÑÑÐ¸Ñ Ð´Ð¸Ð°Ð³ÑÐ°Ð¼Ð¼ Ð±ÑÐ»Ð° Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð° ÑÑÐ¾ÑÐ¾Ð½Ð½ÑÑ Ð±Ð¸Ð±Ð»Ð¸Ð¾ÑÐµÐºÐ° JavaBDD. Ð ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐµ, Ð±ÑÐ» ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½ ÑÑÐµÐ½Ð°Ð¶ÐµÑ, Ð¾Ð¿ÐµÑÐ¸ÑÑÑÑÐ¸Ð¹ Ð»Ð¾Ð³Ð¸ÑÐµÑÐºÐ¸Ð¼ Ð°Ð³ÐµÐ½ÑÐ¾Ð¼, ÐºÐ¾ÑÐ¾ÑÑÐ¹ Ð°Ð²ÑÐ¾Ð¼Ð°ÑÐ¸Ð·Ð¸ÑÐ¾Ð²Ð°Ð½Ð½Ð¾ ÑÐµÑÐ°ÐµÑ Ð·Ð°Ð´Ð°ÑÑ Â«Ð¡Ð°Ð¿ÐµÑÂ» Ñ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸ÐµÐ¼ Ð±Ð¸Ð½Ð°ÑÐ½ÑÑ ÑÐµÑÐ°ÑÑÐ¸Ñ Ð´Ð¸Ð°Ð³ÑÐ°Ð¼Ð¼. ÐÐ° ÐºÐ°Ð¶Ð´Ð¾Ð¼ ÑÐ¾Ð´Ðµ Ð°Ð³ÐµÐ½ÑÐ° Ð¾Ñ Ð¾Ð±ÑÑÐ°ÑÑÐµÐ³Ð¾ÑÑ ÑÑÐµÐ±ÑÐµÑÑÑ Ð²Ð²ÐµÑÑÐ¸ ÑÑÐ½ÐºÑÐ¸Ñ-Ð¾Ð³ÑÐ°Ð½Ð¸ÑÐµÐ½Ð¸Ðµ, ÑÐ¾Ð¾ÑÐ²ÐµÑÑÑÐ²ÑÑÑÐµÐµ ÑÐµÐºÑÑÐµÐ¹ ÑÐ¸ÑÑÐ°ÑÐ¸Ð¸ Ð½Ð° ÐºÐ°ÑÑÐµ. Ð¤ÑÐ½ÐºÑÐ¸Ñ Ð·Ð°Ð´Ð°ÐµÑÑÑ Ñ Ð¿Ð¾Ð¼Ð¾ÑÑÑ ÑÐ¿Ð¸ÑÐ¾ÑÐ½Ð¾Ð³Ð¾ Ð¿ÑÐµÐ´ÑÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð±Ð¸Ð½Ð°ÑÐ½Ð¾Ð¹ ÑÐµÑÐ°ÑÑÐµÐ¹ Ð´Ð¸Ð°Ð³ÑÐ°Ð¼Ð¼Ñ. ÐÐ½Ð° Ð°Ð²ÑÐ¾Ð¼Ð°ÑÐ¸ÑÐµÑÐºÐ¸ Ð¿ÑÐ¾Ð²ÐµÑÑÐµÑÑÑ. ÐÐ¾ ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐ°Ð¼ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸, ÑÑÐµÐ½Ð°Ð¶ÐµÑ Ð²ÑÐ´Ð°ÐµÑ Ð¸Ð½ÑÐ¾ÑÐ¼Ð°ÑÐ¸Ñ Ð¾ ÑÐ¾Ð¼, ÐºÐ¾ÑÑÐµÐºÑÐ½Ð¾ Ð»Ð¸ Ð±ÑÐ»Ð¾ Ð²Ð²ÐµÐ´ÐµÐ½Ð½Ð¾Ðµ Ð¾Ð±ÑÑÐ°ÑÑÐ¸Ð¼ÑÑ Ð¾Ð³ÑÐ°Ð½Ð¸ÑÐµÐ½Ð¸Ðµ.
description: This thesis examines an approach to development of an educational game for students studying mathematical logic and having difficulty with binary decision diagrams. The main method that the educational game uses is an agent that solves the Minesweeper problem as constraint satisfaction problem using logical inference. All constraints in the Minesweeper problem were formalized beforehand in propositional calculus and every Boolean functions are represented in binary decision diagrams. The game is developed in AnyLogic Simulation Software and therefore, written in Java programming language. For representing Boolean functions as BDD, a third-party library JavaBDD was used. As a result, an educational game was developed that has a logical agent that automatically solves the Minesweeper problem using binary decision diagrams. With every step of agent, the student is required to insert the constraint function that lines up with certain state on a field. This function is defined by a table representation of the BDD, and then it is automatically checked. Consequentially, the game informs the student whether the inserted data was correct.