SHORTEST PATH FINDER(BFS).py

import curses
from curses import wrapper
import queue
import time

maze = [
    ["#", "#", "#", "#", "O", "#", "#", "#", "#"],
    ["#", " ", " ", " ", " ", " ", " ", " ", "#"],
    ["#", " ", "#", "#", " ", "#", "#", " ", "#"],
    ["#", " ", "#", " ", " ", " ", "#", " ", "#"],
    ["#", " ", "#", " ", "#", " ", "#", " ", "#"],
    ["#", " ", "#", " ", "#", " ", "#", " ", "#"],
    ["#", " ", "#", " ", "#", " ", "#", "#", "#"],
    ["#", " ", " ", " ", " ", " ", " ", " ", "#"],
    ["#", "#", "#", "#", "#", "#", "#", "X", "#"]
]



def print_maze(maze,stdscr,path=[]):
    BLUE=curses.color_pair(1)
    RED=curses.color_pair(2)
    #enumerate lets you loop through index and elements also
    for i,row in enumerate(maze): #i is the row(index) in maze row is the list on that i
        for j,value in enumerate(row): #j is the col in the row and value means "#" or "x" or " "
            if (i,j) in path:
                stdscr.addstr(i,j*2 ,"X",RED)
            else:
                stdscr.addstr(i,j*2 ,value,BLUE)

def find_start(maze,start):
    for i,row in enumerate(maze):
        for j,value in enumerate(row):
            if value==start:
                return i,j
    return None

def bfs(maze,stdscr):
    start="O"
    end="X"
    start_pos=find_start(maze,start)

    q=queue.Queue()
    q.put((start_pos,[start_pos]))
    
    visited=set({})

    while not q.empty():
        current_pos,path=q.get()
        row,col=current_pos

        stdscr.clear() #clear the entire screen
        print_maze(maze,stdscr,path)  #top left corner 
        time.sleep(0.2)
        stdscr.refresh()#refresh the screen

        if maze[row][col]==end:
            return path
        
        neighbors=find_neighbors(maze,row,col)
        for neighbor in neighbors:
            if neighbor in visited:
                continue

            r,c=neighbor
            if maze[r][c]=="#":
                continue

            new_path=path+[neighbor]
            q.put((neighbor,new_path))
            visited.add(neighbor)

def find_neighbors(maze,row,col):
    neighbors=[]

    if row>0: #up
        neighbors.append((row-1,col))
    if row+1<len(maze):#down
        neighbors.append((row+1,col))
    if col>0:#left
        neighbors.append((row,col-1))
    if col+1<len(maze[0]):#right
        neighbors.append((row,col+1))

    return neighbors

def main(stdscr):
    curses.init_pair(1,curses.COLOR_BLUE,curses.COLOR_BLACK)#initialize the color  
    curses.init_pair(2,curses.COLOR_RED,curses.COLOR_BLACK)
    #blue_and_black=curses.color_pair(1) #using the color pair
    bfs(maze,stdscr)
    stdscr.getch() #get char similar to input statement
    
wrapper(main)