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用戶請點擊瀏覽器圖標
選擇“Disable on www.wenxuecity.com”

安裝Adblock用戶請點擊圖標
選擇“don't run on pages on this domain”