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

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.
主站蜘蛛池模板: 中宁县| 堆龙德庆县| 邓州市| 灵台县| 璧山县| 徐汇区| 石家庄市| 东源县| 衡东县| 漠河县| 衡东县| 吴堡县| 抚松县| 岳阳市| 隆林| 巴彦淖尔市| 小金县| 河间市| 东城区| 厦门市| 海阳市| 罗定市| 达州市| 清镇市| 仲巴县| 资源县| 湖南省| 安阳县| 临桂县| 苏尼特左旗| 新干县| 五大连池市| 肥乡县| 恩施市| 绍兴县| 台中市| 甘洛县| 七台河市| 平定县| 石棉县| 秀山|