@cocacola-lover/knight_path_finder/test/all_alrorithms.test.js

Iterative path finding Algorithms for knight on a chessboard

import {Board, SearchResult, PathFindingIterators} from './../dist/index';

const canReach = (a, b, searchMethod) => {
    const board = new Board(10, 10);

    const ite = searchMethod(board.createBasicPointer(a[0],a[1]), board.createBasicPointer(b[0], b[1]));
    while((ite()).result === SearchResult.SearchContinues);

    expect(board.squares[b[0]][b[1]].distanceFromStart).not.toBe(undefined);

    let walkBack = board.squares[b[0]][b[1]];
    while(walkBack.shortestPath !== undefined) walkBack = walkBack.shortestPath.at();
    expect(walkBack).toBe(board.createBasicPointer(a[0],a[1]).at());
}

test("Testing if they can reach", () => {
    const points = [[0, 0], [3, 1], [5, 6], [3, 4], [5, 9], [1, 1]];
    for (let i = 0; i < points.length - 1; i++) {
        Object.values(PathFindingIterators).forEach((method) => canReach(points[i], points[i+1], method));
    }
})