Python Path Finding Tutorial - Breadth First Search Algorithm 

I agree, the foundation of this algorithm is explained but without any explanation of validMoves() or findEnd(), it is difficult to understand how this algorithm is applied to this 'maze' situation

@@shallwebeginvg5750 I agree

This was actually bothering me in the video. Thanks!

Thank you!!!!

you change it in the main function ?

Se te reza papi?

practice* dont be a sucky british person please.

ironic you spelt pronunciation wrong

xD

​@@mcmisterhd1920 or you can simply change already visited places with "#"

@@elnur0047 I agree with you!

pro tip : you can watch series at flixzone. Me and my gf have been using them for watching all kinds of movies these days.

@Jakob Cayson Definitely, I've been watching on Flixzone} for since november myself :)

Both paths are added to the queue. The queue stores all valid moves until the destination is reached, in which case it will pick the current stored (shortest) path.

hi same i am also stuck at this point where ik the basics but idk how to impliment minimax algoritams into my tictactoe games

have you found found a way to learning all these

Not yet

To check if path is inside of the maze boundaries or not and if path doesn't lead to an obstacle

That could work!

Don't know if you still need help on this. If you just went left "L" then there's no point in going right "R". So only put a new path if it's valid and it doesn't go back to the previous position.

Only once

@@TechWithTim what I meant was, instead of using an infinite while loop, if I use a for loop how many iterations do I need

@@arujbansal there's no way of telling there's no exit. Just add a limit. A great adaptative limit is to set it to the size of the map (if the map is 8 by 8, once you get a result that has a length of 64, break the loop because you've at least made all the logical combinations) or in case you have a decision tree, just limit the iterations to the maximum value of the decision tree. Let's say you want to find a binary result for the queue Tim showed in the video, then you'll have to consider 2**15 possibilities, so this would be the limit to break the loop

edited: I think it only works on Python 2.7.16 try using the following code: import Queue as queue import sys def createMaze(): maze = [] maze.append(["#","#", "#", "#", "#", "O","#"]) maze.append(["#"," ", " ", " ", "#", " ","#"]) maze.append(["#"," ", "#", " ", "#", " ","#"]) maze.append(["#"," ", "#", " ", " ", " ","#"]) maze.append(["#"," ", "#", "#", "#", " ","#"]) maze.append(["#"," ", " ", " ", "#", " ","#"]) maze.append(["#","#", "#", "#", "#", "X","#"]) return maze def createMaze2(): maze = [] maze.append(["#","#", "#", "#", "#", "O", "#", "#", "#"]) maze.append(["#"," ", " ", " ", " ", " ", " ", " ", "#"]) maze.append(["#"," ", "#", "#", " ", "#", "#", " ", "#"]) maze.append(["#"," ", "#", " ", " ", " ", "#", " ", "#"]) maze.append(["#"," ", "#", " ", "#", " ", "#", " ", "#"]) maze.append(["#"," ", "#", " ", "#", " ", "#", " ", "#"]) maze.append(["#"," ", "#", " ", "#", " ", "#", "#", "#"]) maze.append(["#"," ", " ", " ", " ", " ", " ", " ", "#"]) maze.append(["#","#", "#", "#", "#", "#", "#", "X", "#"]) return maze def printMaze(maze, path=""): for x, pos in enumerate(maze[0]): if pos == "O": start = x i = start j = 0 pos = set() for move in path: if move == "L": i -= 1 elif move == "R": i += 1 elif move == "U": j -= 1 elif move == "D": j += 1 pos.add((j, i)) for j, row in enumerate(maze): for i, col in enumerate(row): if (j, i) in pos: sys.stdout.write ("+ ") else: sys.stdout.write (col + " ") sys.stdout.write(' ') def valid(maze, moves): for x, pos in enumerate(maze[0]): if pos == "O": start = x i = start j = 0 for move in moves: if move == "L": i -= 1 elif move == "R": i += 1 elif move == "U": j -= 1 elif move == "D": j += 1 if not(0

Additionally, make sure you already did "pip install queuelib" in terminal (if using mac)

@@human.earthling Thanks ❤️

Thanks lol