dist-javascript-algorithms-and-data-structures
Version:
Algorithms and data-structures implemented on JavaScript
17 lines (14 loc) • 745 B
JavaScript
;
var _knightTour = _interopRequireDefault(require("../knightTour"));
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
describe('knightTour', () => {
it('should not find solution on 3x3 board', () => {
const moves = (0, _knightTour.default)(3);
expect(moves.length).toBe(0);
});
it('should find one solution to do knight tour on 5x5 board', () => {
const moves = (0, _knightTour.default)(5);
expect(moves.length).toBe(25);
expect(moves).toEqual([[0, 0], [1, 2], [2, 0], [0, 1], [1, 3], [3, 4], [2, 2], [4, 1], [3, 3], [1, 4], [0, 2], [1, 0], [3, 1], [4, 3], [2, 4], [0, 3], [1, 1], [3, 0], [4, 2], [2, 1], [4, 0], [3, 2], [4, 4], [2, 3], [0, 4]]);
});
});