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

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.
主站蜘蛛池模板: 河源市| 外汇| 徐州市| 木兰县| 洛阳市| 乌审旗| 蛟河市| 景东| 永胜县| 通海县| 福鼎市| 临泽县| 仙桃市| 北安市| 榆中县| 淮阳县| 乌海市| 阳东县| 镇坪县| 苍山县| 横山县| 新乡县| 澳门| 蚌埠市| 赞皇县| 清涧县| 明光市| 腾冲县| 湘西| 乐山市| 南宫市| 娄烦县| 安丘市| 防城港市| 萨迦县| 历史| 平武县| 赤水市| 大竹县| 呈贡县| 公安县|