backtracking algorithms

Author: loiane

src/ts/algorithms/backtracking/rat-in-maze.ts

@@ -8,7 +8,7 @@ export function ratInAMaze(maze: Array<Array<number>>) {
     }
   }
 
-  if (findPath(maze, 0, 0, solution) === false) {
+  if (findPath(maze, 0, 0, solution) === true) {
     return solution;
   } else {
     return 'NO PATH FOUND';

test/ts/algorithms/backtracking/rat-in-maze.spec.ts

@@ -0,0 +1,21 @@
+import 'mocha';
+import { expect } from 'chai';
+import { ratInAMaze } from '../../../../src/ts/index';
+
+describe('Rat in a maze', () => {
+  it('rat in a maze solver', () => {
+    const maze = [
+      [1, 0, 0, 0],
+      [1, 1, 1, 1],
+      [0, 0, 1, 0],
+      [0, 1, 1, 1]
+    ];
+    const solution = [
+      [1, 0, 0, 0],
+      [1, 1, 1, 0],
+      [0, 0, 1, 0],
+      [0, 0, 1, 1]
+    ];
+    expect(ratInAMaze(maze)).to.deep.equal(solution);
+  });
+});

test/ts/algorithms/backtracking/sudoku-solver.spec.ts

@@ -28,4 +28,30 @@ describe('Sudoku Solver', () => {
     ];
     expect(sudokuSolver(grid)).to.deep.equal(solution);
   });
+
+  it('sudoku solver 2', () => {
+    const grid = [
+      [5, 3, 0, 0, 7, 0, 0, 0, 0],
+      [6, 0, 0, 1, 9, 5, 0, 0, 0],
+      [0, 9, 8, 0, 0, 0, 0, 6, 0],
+      [8, 0, 0, 0, 6, 0, 0, 0, 3],
+      [4, 0, 0, 8, 0, 3, 0, 0, 1],
+      [7, 0, 0, 0, 2, 0, 0, 0, 6],
+      [0, 6, 0, 0, 0, 0, 2, 8, 0],
+      [0, 0, 0, 4, 1, 9, 0, 0, 5],
+      [0, 0, 0, 0, 8, 0, 0, 7, 9]
+    ];
+    const solution = [
+      [5, 3, 4, 6, 7, 8, 9, 1, 2],
+      [6, 7, 2, 1, 9, 5, 3, 4, 8],
+      [1, 9, 8, 3, 4, 2, 5, 6, 7],
+      [8, 5, 9, 7, 6, 1, 4, 2, 3],
+      [4, 2, 6, 8, 5, 3, 7, 9, 1],
+      [7, 1, 3, 9, 2, 4, 8, 5, 6],
+      [9, 6, 1, 5, 3, 7, 2, 8, 4],
+      [2, 8, 7, 4, 1, 9, 6, 3, 5],
+      [3, 4, 5, 2, 8, 6, 1, 7, 9]
+    ];
+    expect(sudokuSolver(grid)).to.deep.equal(solution);
+  });
 });