Skip to content

Forward Chaining Algorithm for Solving the Shortest Path Problem in Arbitrary Deterministic Environment in Linear Time - Applied for the Tower of Hanoi Problem.

Silvana Petruseva

Year2009
ProceedingsKI

Browse the full KI paper archive.