Round table problem

来源: innercool 2009-11-19 21:47:44 [] [博客] [旧帖] [给我悄悄话] 本文已被阅读: 次 (716 bytes)
本文内容已被 [ innercool ] 在 2009-12-19 10:49:50 编辑过。如有问题,请报告版主或论坛管理删除.
In a dark room there is a rotating round table, with 4 symmetrically located indistinguishable buttons. Each button can be either "on" or "off", however inside the room one has no way to know what is the current state. When the 4 buttons are all "on", and there is nobody inside, the room is lighted.

The problem is as follows. A person is (repeatedly) allowed to enter the room, and press whichever buttons he likes (that is, he can change the states of more than one buttons). After he steps out, he is told whether he succeeded to put the light on. At the same time, a table rotates in an unknown manner. Design a deterministic strategy to put the light on starting
from an unknown starting state.

所有跟帖: 

回复:Round table problem -火球魔法- 给 火球魔法 发送悄悄话 火球魔法 的博客首页 (1288 bytes) () 11/20/2009 postreply 23:56:02

请您先登陆,再发跟帖!

发现Adblock插件

如要继续浏览
请支持本站 请务必在本站关闭/移除任何Adblock

关闭Adblock后 请点击

请参考如何关闭Adblock/Adblock plus

安装Adblock plus用户请点击浏览器图标
选择“Disable on www.wenxuecity.com”

安装Adblock用户请点击图标
选择“don't run on pages on this domain”