СОЗДАНИЕ ЛАБИРИНТА С НЕСКОЛЬКИМИ ПРОХОДАМИ, ПОИСК ВСЕХ ПУТЕЙ В НЕМ И ИХ РЕДАКТИРОВАНИЕ

Э.С. Симонян, О.А. Медведева & С.Н. Медведев
This article considers the problem of creating a maze with multiple solutions, searching for all solutions and a possibility of editing them. First, we view two algorithms, which generate the most various mazes, and find their positive and negative sides. Then we choose the one most efficient and suitable for the problem. All maze creation algorithms, including two considered, are unable to reveal a definite number of solutions. Here we offer a modification of Wilsons...
This data center is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.
We found no citations for this text. For information on how to provide citation information, please see our documentation.