官术网_书友最值得收藏!

The Byzantine Generals' Problem

Imagine a time during the dark ages, where a pirate ship is under attack. There are 200 pirates aboard the pirate ship surrounded by six army ships of 50 warriors each, who've anchored, surrounding the pirate ship. Each army ship is commanded by a captain. The 300 warriors can easily overpower the 200 pirates aboard the pirate ship. However, if they don't all attack simultaneously, there is a very real risk that the warriors will be outnumbered by the pirates and they'll go on to lose the battle.

Figure 1.2: Pirate ship (200) surrounded by arm ship (50)

So, how can the captains all agree on the same time to attack the pirate ship? These days, we'd simply need a quick group video-conference call, and the captains would have to agree to attack at 22:00 hours (10 PM).

However, back in the dark ages, things were a little more complicated:

  • The 22:00 attack message could only be passed on by a sailor on a small boat. He has to sail around each army ship, visiting each captain in turn to confirm.
  • Any captain may be a traitor and in league with the pirates in the pirate ship.
主站蜘蛛池模板: 上高县| 灵石县| 宿迁市| 登封市| 正蓝旗| 营口市| 紫金县| 安多县| 同心县| 万山特区| 岑溪市| 阜平县| 吕梁市| 尼木县| 泾阳县| 庆城县| 昌邑市| 谢通门县| 深州市| 西乌珠穆沁旗| 德格县| 来凤县| 疏附县| 丰都县| 大英县| 孟连| 孟连| 孝感市| 江达县| 常山县| 日土县| 潮州市| 大同市| 贵阳市| 丘北县| 澳门| 榆树市| 陈巴尔虎旗| 乌兰浩特市| 华坪县| 鸡东县|