Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

Rat in a Maze

Suppose we have a matrix with size N*N, and each position of the matrix is a block. The position (or block) can be free (value 1) or it can be blocked (value 0), as shown in the following diagram, where S is source and D is destination:

The matrix is the maze and the goal is for the "rat" to start at position [0][0] and go to position [n-1][n-1] (destination). The rat can move in two directions: vertically or horizontally in any position that is not blocked. 

Let's start declaring the basic structure of our algorithm, as follows:

export function ratInAMaze(maze) {  const solution = []; for (let i = 0; i < maze.length; i++) { // ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content