//
// Created by nano on 4/30/25.
//

#ifndef LEE_ALGORITHM_H
#define LEE_ALGORITHM_H

#include "../stack/stack.h"
#include "../robot/robot.h"

#define MAZE_SIZE 11

void followPath(robot *r, stack *path,int visited[MAZE_SIZE][MAZE_SIZE]);

void lee_run(robot r, cell targetCell, stack *moves);

void lee_expand(int assignmentMatrix[MAZE_SIZE][MAZE_SIZE], cell startCell,cell targetCell) ;
void lee_trace(int assignmentMatrix[MAZE_SIZE][MAZE_SIZE], robot r, cell targetCell, stack *stack);

int validatePath(robot r, stack s);

int isInBound(cell c);
int isStation(cell c);
int isValidCrossing(cell c);
#endif //LEE_ALGORITHM_H