search

RPI-Subway-Challenge / subwayChallenge

Finds fastest path through all 472 NYC subway stations
https://en.wikipedia.org/wiki/Subway_Challenge
MIT License
8 stars 1 forks source link

Revise heuristics function #51

Closed yeyun163 closed 1 year ago

yeyun163 commented 2 years ago

Current function takes in two stations, the current station and the next station, and spits out a heuristics value based on those two stations. Change the function to also account for isolated unvisited stations Initialize each station with a default heuristic value, and allow propagation of heuristic values between connected neighbors to give the algorithm a general direction to go in, when isolated unvisited stations occur.

yeyun163 commented 2 years ago

consider having heuristics be multiplicative instead of additive