Add wormhole.cpp. Greedy, DFS.
In isTrapped(), it should walk N times. N is the number of pairings, not the number of points.
Add skidesign.cpp. Brutal force. Suppose the ideal range is [low, high], where low is in [lowest, highest-17]. Find the minimum cost of each range. if they are large, what should we do?