I am trying to implement a randomly generated maze using Prim's algorithm. I want my maze to look like this: however the mazes that I am generating from my program look like this: I'm current...

I searched and even visited a maze-algorithm-collecting website, but nothing satisfies the following statements I require. To make it clear, I need an infinite maze generating algorithm that follow...

I want to solve a maze in R. I created a function inspired by corresponding Python code: Solving mazes using Python: Simple recursivity and A* search. I have a maze (i.e. a matrix), where: 0 = empt...

I know we can use DFS for maze exploration. But I think we can also use BFS for maze exploration. I'm little bit confused here because most of the books and articles that I've read had used DFS for...

Consider a MxN bitmap where the cells are 0 or 1. '1' means filled and '0' means empty. Find the number of 'holes' in the bitmap, where a hole is a contiguous region of empty cells. For example, ...

I am trying to find (using Python) all possible solutions to a maze. I have a DFS script that returns one solution. I am trying to adapt it but I'm really having a hard time wrapping my head around...

I am trying to develop an algorithm that converts simple mono line images ie Maze, to a text 2d array. For example, the image below, it would be converted to the following text array. [|----------...

I have to find shortest path from the center of the maze to the outermost circle. I have to solve this problem using opencv and python

What is the best way to represent and solve a maze given an image? Given an JPEG image (as seen above), what's the best way to read it in, parse it into some data structure and solve the maze? M...

I am working or understanding how to create a simple java 2d maze that should look like this: int [][] maze = { {1,1,1,1,1,1,1,1,1,1,1,1,1}, {1,0,1,0,1,0,1,0,0,0,0,0,1}, {1,0,1,0,0,0,1,0,1,1,1,...

Say you want a simple maze on an N by M grid, with one path through, and a good number of dead ends, but that looks "right" (i.e. like someone made it by hand without too many little tiny dea...

I am trying to convert a maze data structure into a graph. The maze is like a grid and some walls between cells. maze[8][8][4] is how the maze is represented. If maze[i][j][0] = 1 it means you can...

I recently made a project to solve a given maze using different pathfinding algorithms. I did this by importing a black and white maze image, and making each junction a node. I tried solving this u...

I want some way (In Python 3) to read pixels of a maze image and the expected output should be a binary list [[1, 1, 0], [1, 1, 1], [1, 0, 0]] (1 for white and 0 for black for example) (should look...

I came across this quite interesting problem, where we have a 4x4 maze and a robot in it trying to get to the goal. The thing is, you have to find a sequence of predefined commands that will always...

I am using Prim's Algorithm to create a maze. I have successfully done so, but I am now trying to make it 'harder' by changing the way that it selects potential cells to be added to the maze. In my...

[Updated my questions at the end] I am creating a 2d multiplayer RTS game which happens inside a maze. I have used Growing Tree algorithm to randomly generate the maze. I thought that the maze woul...

I want to solve a maze automatically when I run the program. My maze is like this at the beginning. 1 0 0 0 0 0 1 0 0 1 1 0 0 1 1 0 At the end it should look like this : 0 1 1 1 1 1 0 1 1 0 0...

Are there algorithms to produce 3 dimensional mazes? Essentially the same as a 2D maze but the Z depth axis can be traversed? The idea is still the same though, to get from Start to End. Coul...

I'm trying to create a program that will traverse a randomly generated maze where 1's are open and 0's are walls. starting in the top left and ending in the bottom right. The path can go up, down, ...

Given a source and a destination cell in a maze, I would like to find all possible solutions to a maze using DFS. 0 represents a wall in my maze. Visualise the maze I've successfully writte...

I seem to have a problem with my maze generating program made in Python. I'm trying to randomly create a path that branches out at select points, with the points getting stored as it goes alo...

I've been assigned with the task of creating a maze solver in Java. Here's the assignment: Write an application that finds a path through a maze. The maze should be read from a file. A sample maz...

I am trying to figure out if this algorithm is A* (A-Star) Algorithm or whatever but still I am confused. Stack<Cell> stack = new Stack<>(); stack.push(maze.start()); stack.peek().mar...

In an interview, my interviewer asked me this question: Develop a function to generate a random maze This is a quite difficult question to solve in 30min if you don't have solved this question...