Maze Solving Algorithms - Revision history

Mol: /* Introduction */

2026-04-05T12:52:52Z

Introduction

← Older revision		Revision as of 15:52, 5 April 2026
Line 8:		Line 8:
	# Maze-routing algorithm		# Maze-routing algorithm
	# Shortest path algorithm		# Shortest path algorithm
	## breadth-first search		## breadth-first search (BFS)
	## the A* algorithm		## the A* algorithm
			## Depth-First Search (DFS).
			## Dijkstra’s Algorithm
	# Multi-agent maze-solving		# Multi-agent maze-solving

Mol: /* Introduction */

2026-04-05T12:43:34Z

Introduction

← Older revision		Revision as of 15:43, 5 April 2026
Line 7:		Line 7:
	# Dead-end filling		# Dead-end filling
	# Maze-routing algorithm		# Maze-routing algorithm
			# Shortest path algorithm
			## breadth-first search
			## the A* algorithm
			# Multi-agent maze-solving

	== Dead-end filling ==		== Dead-end filling ==

Mol: /* Introduction */

2026-04-05T12:41:28Z

Introduction

← Older revision		Revision as of 15:41, 5 April 2026
Line 6:		Line 6:
	# Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end.		# Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end.
	# Dead-end filling		# Dead-end filling
			# Maze-routing algorithm


			== Dead-end filling ==

	== ==		== ==

Mol: /* Introduction */

2026-04-05T12:39:13Z

Introduction

← Older revision		Revision as of 15:39, 5 April 2026
Line 4:		Line 4:
	# Hand-on-Wall rule (works If the maze is simply connected)		# Hand-on-Wall rule (works If the maze is simply connected)
	# Pledge algorithm		# Pledge algorithm
	# Trémaux's algorithm		# Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end.
	# Dead-end filling		# Dead-end filling

Mol: /* Introduction */

2026-04-05T12:37:01Z

Introduction

← Older revision		Revision as of 15:37, 5 April 2026
Line 5:		Line 5:
	# Pledge algorithm		# Pledge algorithm
	# Trémaux's algorithm		# Trémaux's algorithm
			# Dead-end filling

	== ==		== ==

Mol: /* Introduction */

2026-04-05T12:34:56Z

Introduction

← Older revision		Revision as of 15:34, 5 April 2026
Line 4:		Line 4:
	# Hand-on-Wall rule (works If the maze is simply connected)		# Hand-on-Wall rule (works If the maze is simply connected)
	# Pledge algorithm		# Pledge algorithm
	#		# Trémaux's algorithm


	== ==		== ==

Mol: Created page with "== Introduction == # Random movement algorithm # Hand-on-Wall rule (works If the maze is simply connected) # Pledge algorithm # == == == == == == == =="

2026-04-05T12:21:15Z

Created page with "== Introduction == # Random movement algorithm # Hand-on-Wall rule (works If the maze is simply connected) # Pledge algorithm # == == == == == == == =="

New page

== Introduction ==

# Random movement algorithm
# Hand-on-Wall rule (works If the maze is simply connected)
# Pledge algorithm
#

== ==
== ==
== ==
== ==