<
查看: 3771| 回复: 6
收起左侧

[金工金数] 刷量化题中求大神帮忙

本楼:   👍  2
100%
0%
0   👎
全局:   4
100%
0%
0

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看附件。没有帐号?注册账号

x
先抱歉一下,我太弱了麻烦大家帮忙。正在刷量化题应付面试,但是有道题不会,如下

You are standing in a vast, flat desert on a moonless night. It is foggy, overcast, and raining hard. You are one mile from the only road, which is perfectly straight and infinitely long in both directions. You can’t see the road until you are right on top of it. What is your strategy for finding the road with minimum hiking in the worst case?

怎么感觉这道题限定条件挺少的,都不知道怎么出发。总之先跪谢了!

补充内容 (2023-06-20 22:17 +08:00):

我已经找到解了,大家可以去网上搜这个问题的最原始名字叫Bellman's lost in a forest problem

上一篇:小hedge fund工作3年被裁,目前有点迷茫
下一篇:[金融] 出无期限日期的Becker cpa账号
 楼主| summeryanxi 2023-6-20 22:16:08 | 显示全部楼层
本楼:   👍  1
100%
0%
0   👎
全局:   4
100%
0%
0
nyufufu 发表于 2023-6-20 17:44.--
往任意方向走 1 mile 然后绕原点走一圈吧。

我最开始也是这么想的,但这个应该是最差的方法,我找到解了,你可以搜Bellman's lost in a forest problem
回复

使用道具 举报

nyufufu 2023-6-20 17:44:50 | 显示全部楼层
本楼:   👍  0
0%
0%
0   👎
全局:   1791
93%
7%
126
往任意方向走 1 mile 然后绕原点走一圈吧。
回复

使用道具 举报

本楼:   👍  0
0%
0%
0   👎
全局:   9042
86%
14%
1431
Finding the road in the scenario you've described is primarily a navigation problem, and it requires some knowledge of geometry. In a situation like this, where visibility is essentially zero, the best strategy involves a well-defined, systematic search pattern. Here's a potential method you could use:
. 1point3acres.com
Pick a direction and start walking straight. It doesn't matter which direction; let's say you walk north.

After walking one mile, if you haven't found the road, turn 90 degrees to your right (which is east).

Walk for one mile in the east direction.

Now, turn 90 degrees to your right again (this will make you face south), and walk for two miles. This will put you one mile south of your original position, and one mile east.. 1point 3acres

Turn 90 degrees to your right again (you'll be facing west), and walk for three miles.

Turn 90 degrees to your right (facing north), and walk for four miles.

You're essentially following a spiral search pattern, where each leg of your journey is one mile longer than the previous. This method ensures that you'll eventually cross the road. In the worst-case scenario, you'd walk approximately 2 miles because the road could be just to your east or west, but you started by walking north. However, the average distance will be much less than this.. 1point3acres.com
. 1point 3acres
It's also important to note that this method assumes you can maintain a straight line and keep track of the distance you've traveled, which could be challenging in poor visibility conditions. It would be helpful if you had a compass or another method of maintaining your bearing, as well as a pedometer or other way to estimate distance. If you had no tools at all, you would have to rely on other navigation skills, such as recognizing changes in terrain or wind direction, to help you keep a straight line.
回复

使用道具 举报

nyufufu 2023-6-21 16:31:38 来自APP | 显示全部楼层
本楼:   👍  0
0%
0%
0   👎
全局:   1791
93%
7%
126
微信用户_de75404 发表于 2023-06-20 07:44:14
Finding the road in the scenario you've described is primarily a navigation problem, and it requires
一眼gpt
回复

使用道具 举报

nyufufu 2023-6-21 16:32:13 来自APP | 显示全部楼层
本楼:   👍  0
0%
0%
0   👎
全局:   1791
93%
7%
126
summeryanxi 发表于 2023-06-20 07:16:08
我最开始也是这么想的,但这个应该是最差的方法,我找到解了,你可以搜Bellman's lost in a forest problem
求解释,Bellman's lost in a forest的简化版本?哪里有解法没找到

补充内容 (2023-06-21 16:35 +08:00):
绕一圈也就3.1mile,真有最坏情况下小于等于4mile的方案?
回复

使用道具 举报

本楼:   👍  0
0%
0%
0   👎
全局:   385
84%
16%
76
任意时刻以知区域是曾去过的点的convex hull. 找到这个convex hull 的过当前点的最长边。行进方向应该与之垂直。这样可以得到一个微分方程。解我猜是一个螺线。
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

Advertisement
>
快速回复 返回顶部 返回列表