console.log(input);

const wall = 'W';

const maze = input.split('\n').map(s => s.split(''));

const accessed = input.split('\n').map(s => s.split('').fill(false));

const width = maze[0].length;

const height = maze.length;

let count = 0;

const step = findExitWithBfs();

console.log("\n", { count });

return step != -1 ? step : false;

function findExitWithBfs() {

const directions = [[1, 0], [0, 1], [-1, 0], [0, -1]];

const queue = [{

position: [0, 0],

step: 0

}];

while (queue.length > 0) {

count++;

const first = queue.shift();

const { position: [x, y], step } = first;

accessed[y][x] = true;

if (x == width - 1 && y == height - 1) {

return step;

}

else {

for (let index = 0; index < directions.length; index++) {

const [xOffset, yOffset] = directions[index];

const nextX = x + xOffset;

const nextY = y + yOffset;

if (nextX >= 0 && nextY >= 0 && nextX < width && nextY < height && maze[nextY][nextX] != wall && !accessed[nextY][nextX]) {

if (-1 == queue.findIndex(({ position: [x, y], _ }) => x == nextX && y == nextY)) {

queue.push({

position: [nextX, nextY],

step: step + 1

});

}

}

}

}

}

return -1;

}

const str = maze.map(a => a.join(' ')).join('\n');

console.log('maze:');

console.log(str);

// input.shift();

// input = input.replace("\r\n\r\n",'');

input = input.replace(/^\n/, '');

console.time();

// const result = input;

const result = pathFinder(input);

console.timeEnd();

console.log({ result });