@cocacola-lover/knight_path_finder
Version:
Iterative path finding Algorithms for knight on a chessboard
11 lines (10 loc) • 594 B
TypeScript
import ChessPointer from "./chess_pointer.js";
import { SearchIterator } from "./interfaces.js";
import BasicPointer = ChessPointer.BasicPointer;
declare namespace PathFindingIterators {
function deepFirstSearchIterator(start: BasicPointer, end: BasicPointer): SearchIterator;
function dijkstraSearchIterator(start: BasicPointer, end: BasicPointer): SearchIterator;
function greedySearchIterator(start: BasicPointer, end: BasicPointer): SearchIterator;
function aStarSearchIterator(start: BasicPointer, end: BasicPointer): SearchIterator;
}
export default PathFindingIterators;