PHP uses stack to solve maze problem

<?php
# Maze problem 
# resolvent 
#1. backtracking   Start with a node , Find any point where you can walk , When you can't find a place to go , Go back to the previous point to find out if there is any other direction   Use the stack to store the current path 

$maze = [
    [1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
    [1, 0, 0, 1, 0, 0, 0, 1, 0, 1],
    [1, 0, 0, 1, 0, 0, 0, 1, 0, 1],
    [1, 0, 0, 0, 0, 1, 1, 0, 0, 1],
    [1, 0, 1, 1, 1, 0, 0, 0, 0, 1],
    [1, 0, 0, 0, 1, 0, 0, 0, 0, 1],
    [1, 0, 1, 0, 0, 0, 1, 0, 0, 1],
    [1, 0, 1, 1, 1, 0, 1, 1, 0, 1],
    [1, 1, 0, 0, 0, 0, 0, 0, 0, 1],
    [1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
];

function getDirection($x, $y)
{
    
    $direction = [
        [$x + 1, $y], # Next 
        [$x - 1, $y], # On 
        [$x, $y - 1], # Left 
        [$x, $y + 1]  # Right 
    ];
    return $direction;
}

function maze_path($x, $y, $x1, $y1, $maze)
{
    
    $stack = [];
    array_push($stack, [$x, $y]);                            # Initialize the starting point 

    while (count($stack) > 0) {
                    # If the path is not empty 
        $cur_node = end($stack);        #  Current node 
        if ($cur_node[0] == $x1 && $cur_node[1] == $y1) {
        # If the point of the path is the same as the end point, it means that there is a path 
            return $stack;                # Return all paths in the stack 
        }
        $diretion = getDirection($cur_node[0], $cur_node[1]);    # Get the four directions of the current coordinate 
        $i = 0;
        $pass = 0; #  Is there a way 
        while ($i < 4) {
    
            $next_node = $diretion[$i];            # Whether the four directions of the cycle can go 
            if ($maze[$next_node[0]][$next_node[1]] == 0) {
            # If the next node can go   Store the coordinates on the stack 
                array_push($stack, $next_node);
                $maze[$next_node[0]][$next_node[1]] = 2;            # Change the coordinates of the road to 2
                $pass = 1; #  There is a way 
                break;
            }
            $i++;
        }
        if (!$pass) {
      #  have no way out 
            /*print_r($next_node); echo "\n"; print_r($stack); echo "\n"; print_r($cur_node); exit;*/
            $maze[$next_node[0]][$next_node[1]] = 2;                    # Change the coordinates of the road to  2
            array_pop($stack);                                # If you can't go in all four directions   Remove the coordinates from the stack 
        }
    }
    return False;
}

$res = maze_path(1, 1, 8, 8, $maze);
if ($res) {
    
    echo ' There is a way ';
    echo "\n";
    print_r($res);
} else {
    
    echo ' There is no way ';
}