@cocacola-lover/knight_path_finder
Version:
Iterative path finding Algorithms for knight on a chessboard
17 lines (16 loc) • 883 B
TypeScript
import ChessPointer from "./chess_pointer.js";
import { Square } from "./interfaces.js";
export default class Board {
squares: Square[][];
constructor(height: number, width: number);
forEach(func: (value: Square, x: number, y: number) => any): void;
createBasicPointer: (x: number, y: number) => ChessPointer.BasicPointer;
createKnightPointer: (x: number, y: number) => ChessPointer.KnightPointer;
createKingPointer: (x: number, y: number) => ChessPointer.KingPointer;
createBishopPointer: (x: number, y: number) => ChessPointer.BishopPointer;
createRookPointer: (x: number, y: number) => ChessPointer.RookPointer;
createPawnPointer: (x: number, y: number) => ChessPointer.PawnPointer;
createQueenPointer: (x: number, y: number) => ChessPointer.QueenPointer;
setPassability(arr: boolean[][]): void;
setWeight(arr: number[][]): void;
}