[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/biz/ - Business & Finance

View post   
File: 68 KB, 644x831, Illuminati-signs-POPE-BENEDICT-DEVILS-HORNS.jpg [View same] [iqdb] [saucenao] [google]
10715160 No.10715160 [Reply] [Original]

Just started reading about this a couple minutes ago but couldn't the solution to the "unsolvable" problem be this:

General A and General B have a number for each day of the week + 2. Today is the 2nd, so their number is 4.

General A sends message to General B saying he wants an attack at 13 hours today using the code 18, 14, 4, 13. General B receives the code and knows the number for the day is 4. He adds and subtracts the numbers to get the number 4 (confirming it is General A's message) and the last number is the time (can rotate position every day if required) of attack (13).

General B sends a confirmation message back with the numbers 14, 14, 15, 13 (answer 4).

Generals have to message once a day and if no message received, they retreat.

>> No.10715273
File: 47 KB, 645x968, 1508878933366.jpg [View same] [iqdb] [saucenao] [google]
10715273

>>10715160

>> No.10715428

>>10715160

You've missed the entire point of the problem. Read it again.

>> No.10715525

I have proposed a way in which two nodes can communicate safely across a network displaying the same data. If some of the generals do not follow the plan, they are removed from the network the next day. All I need is a way to verify who was not part of consensus.

>> No.10715607

They key to the next city is in the attacked city and only those that attacked saw it.