Javascript Grid-World Path Finding Algorithms - BFS, DFS, IDDFS and other necessary functions

I have a project - BFS/DFS/IDDFS Grid-World Path-Finding. In this project, we have different grid-world environments written in HTML and javascript. So, we already have built a GUI and the frontend of this and here's what it does: We're presented by a grid map which is like 16x16 squares of a grid. In each map, there are different colors (represented by numbers) and the constraint is that Object can only move through same color tiles in the grid. This can be checked by the following two functions especially isOOB which is is out of bound and we can only move though same color tiles: get(x, y) { return [login to view URL][y*[login to view URL] + x]; } isOOB(x, y) { return x < 0 || y < 0 || (x + 1) > [login to view URL] || (y + 1) > [login to view URL]; } Now, I have a skeleton file without the implementation of bfs, dfs and iddfs which I'm going to paste below. But before that, here's how the front end works. I click on a tile in a color, say blue, in a map with say 3 colors, blue, green and gray. So, I click on a blue tile which marks the starting x,y axis (sx, sy) and then I click on another tile in blue. The GUI is incharge or initiating any functions, all I need to do is implement them. So, after I click on the second tile, based on what we select on the front end like BFS, DFS or IDDFS, the function runs and finds the path and reconstructs the path. If however the second tile that I click on is in green then no path will be found obviously as isLegalAction() is called by the algorithm. Now, I'm pasting the skeleton code file below: