Skip to content
Zach Lichtman
Artificial Intelligence, Cybersecurity, and Robotics.I build things that I wish existed.
Résumé
← Projects

PowderMeet

Where should two skiers separated across a mountain meet? Graph routing over the resort's lifts and trails finds the fairest spot.

PowderMeet

2026

Two skiers, one mountain, one question.

Live across 159 Epic and Ikon resorts.

Born from a winter-break problem no app could answer: where should two skiers separated across a mountain meet? Runs Dijkstra over the resort’s trail and lift graph to find the spot that minimizes the gap between skiers’ arrival times, weighting trail difficulty, lift queues, live closures, and each skier’s pace from their imported tracking history.

Meet in the middle

Dijkstra over the real lift-and-trail graph.

Each skier is routed under their own ability and terrain limits, then candidate meeting points are ranked by when the last person actually arrives and how long the other waits. Trail difficulty, lift queues, live closures, and each skier's measured pace all weigh the graph. Once you go, friends show up live on the map, directions come turn by turn, and the route redraws itself if a lift or run closes.

Real data underneath

Routing is only as good as the mountain model.

Resort graphs are built from OpenStreetMap piste and aerialway data, enriched with elevation, and pinned as immutable snapshots so two phones solve the identical graph. Imported runs from Slopes, GPX, TCX, and FIT are matched to trails to learn your real speed per ski.