Questions tagged [maze]
The maze tag has no usage guidance.
9
questions
0
votes
0
answers
32
views
Algorithm to maximize generated maze score
I need to generate maze with 100x100 rooms. Each room connected only with 1 other room.
Here are example of correct 2x2 mazes:
+-+-+
|...|
+-+.+
|...|
+-+-+
And ...
- 1
0
votes
1
answer
41
views
Pathfinding in a known maze with step limitations, points of interest and more
I hope this is the correct subpage of SE, if not please direct me to the more appropriate place.
Imagine the following scenario:
You are put into a random but known position inside a given maze. The ...
- 101
0
votes
1
answer
74
views
Implementation check for Kruskal's algorithm used for maze generation
I have a pathfinding project and I want to use Kruskal's algorithm as a maze generator. I am using a rank-based disjoint set data structure to detect cycles, which seems to be the standard way.
...
1
vote
1
answer
78
views
Exit quickly from a maze with a local view of the maze
How to efficiently exit from a maze where you know the initial position of the player (1,1), the exit (49,49)?
You don't know the maze configuration but you know where your player is, and which ...
- 111
1
vote
1
answer
300
views
Why is backtracking a necessary step in the Maze problem?
The problem I am working on is specifically this:
A Maze is given as N*N binary matrix of blocks where source block is
the upper left most block i.e., maze[0][0] and destination block is
lower ...
- 113
0
votes
1
answer
159
views
Solving a maze with DFS vs "wall following"
Consider a problem where a "robot cleaner" is placed on a room modeled as a grid. Each cell in the grid can be empty or blocked and all accessible cells are connected, meaning, all empty cells will be ...
- 296
2
votes
1
answer
138
views
"Visited" vs "Seen" Positions in Breadth-First Search
I'm struggling to understand why there is such a radical difference in the execution time and number of steps required by two seemingly similar algorithms for Breadth-First Search in a 2d grid.
In ...
- 255
2
votes
0
answers
24
views
How to find a path in maze with navigator physical size constraints?
Assuming a 2D maze, how would one go about solving it for rigid 2D object moving through it?
Additional specification:
The object shape - it is a single entity, not a swarm/fleet. A shape of ...
- 121
2
votes
1
answer
129
views
Solve Maze Without Feedback
Suppose that we have the following maze (_ = open, + = blocked), and we can move left,right,up,down:
...
- 121