maze

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 I'm out! You can consider every white pixel in the image as a node of an undirected weighted graph. Every pixel (node) is connected to it's white neighbours. The weight of the edge connecting the two nodes is 1 in horizontal and vertical direction, and sqrt(2) (or simply 1.414 ) in diagonal direction. Than, since you know starting and ending point, you can run Dijkstra algorithm to find the shortest path between start and end. I used Rosetta Code implementation

I am trying to create a 5x5 grid with 2 exits and put some walls in it. In other words, I want to create a maze or a labyrinth. I was wondering if there is a way to make a border line thicker or change the colour of only one side of a patch. I want to put only one agent inside and let him find the exit by rewarding him with some points. (Q-learning algorithm) Does anyone have an idea? If this is not possible can you suggest comparable code please? Here is an example of what I want to create: As asked, I've posted some of my work (although it seems inefficient to have done this manually). Here

i want to implement the Recursive backtracker algorithm to solve maze problem, but i cant understand 2.3 Command ("remove the wall between the current cell and the chosen cell") would any help me ? Mark the current cell as 'Visited' If the current cell has any neighbours which have not been visited Choose randomly one of the unvisited neighbours add the current cell to the stack remove the wall between the current cell and the chosen cell Make the chosen cell the current cell Recursively call this function else remove the last current cell from the stack Backtrack to the previous execution of

Imagine we have two randomly selected points between 0 and 100 for both x and y. For example: (95,7), (35,6) Now using the simple pygame.draw.line() function we could easily draw a line between these points without any gaps. My question is, how could we find a list of all the coordinates in a single pixel thick line between the two points without any gaps in the line? Secondly, is this even possible? I am using this list of pixel for the crack maze algorithm that needs to "shoot" another pixel while regarding any blocking walls that may interfere with its path. http://www.astrolog.org/labyrnth

So I am trying to create a maze solver program that would solve a maze of X's and O's. What I would like to do is create a class of Points, so that I can create a 2-Dimensional array of Points which would allow printing to an output page as well as implementing the stack to be relatively simple. The simplest algorithm of the general idea I'd like to implement in the actual program itself I believe should be: 1) Move forward 2) Are you at a wall? 2a) If yes, turn left 3) Are you at the finish? 3a) If no, go to 1 3b) If yes, solved But I'm having trouble coming up with a more in-depth algorithm,