How to generate perfect mazes?-Reference-Cited by-同舟云学术

How to generate perfect mazes?

Published:2021-09 Issue: Volume:572 Page:444-459
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Bellot V.,Cautrès M.,Favreau J-M.,Gonzalez-Thauvin M.,Lafourcade P.,Le Cornec K.,Mosnier B.,Rivière-Wekstein S.

Funder

Université Clermont Auvergne

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference22 articles.

1. D.J. Aldous, The random walk construction of uniform spanning trees and uniform labelled trees, SIAM Journal on Discrete Mathematics 3 (1990) 450–465.

2. Automatic generation of game elements via evolution;Ashlock,2010

3. Search-based procedural generation of maze-like levels;Ashlock;IEEE Transactions on Computational Intelligence and AI in Games,2011

4. A. Broder, Generating random spanning trees, in: 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 442–447.

5. Mazes for Programmers: Code Your Own Twisty Little Passages;Buck,2015

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Comparative Study of Maze Generation Algorithms in a Game-Based Mobile Learning Application for Learning Basic Programming Concepts;Algorithms;2024-09-10

2. Innovative Research on Synergistic Development of Digital Integrated Media and Visual Design Based on Kruskal Algorithm;Applied Mathematics and Nonlinear Sciences;2023-10-02

3. Creating complex mazes quickly: Solution path first;Journal of Computational Methods in Sciences and Engineering;2022-05-13