@cocacola-lover/knight_path_finder
Version:
Iterative path finding Algorithms for knight on a chessboard
27 lines (21 loc) • 607 B
text/typescript
import ChessPointer from "./chess_pointer"
export interface Square {
distanceFromStart? : number,
shortestPath? : ChessPointer.BasicPointer,
isPassable : boolean,
weight : number
}
export enum SearchResult {
SearchContinues, TargetFound, TargetNotFound
}
export interface IterationResult {
result : SearchResult,
from? : ChessPointer.BasicPointer,
to? : ChessPointer.BasicPointer
}
export interface SearchIterator {
() : IterationResult
}
export interface PathFindingAlgo {
(start: ChessPointer.BasicPointer, end: ChessPointer.BasicPointer) : SearchIterator
}