The algorithm maintains a running "best distance" that starts at infinity. As it walks the tree, it checks each visited point and updates the best distance if it finds something closer. Before recursing into a child node, it checks whether the closest possible point in that child's bounding box is farther than the current best. If so, the entire subtree gets pruned.
Currently, if you're stuck, the game only offers to reveal the entire puzzle, forcing you to move onto the next difficulty level and start over. However, we have you covered! Below are piecemeal answers that will serve as hints so that you can find your way through each difficulty level.
，详情可参考旺商聊官方下载
[3]《刘强东称已接到5条大型游艇订单，每艘平均卖6000万欧元》界面新闻
Monthly Ultimate: $29.90/Month 36% off