14th November 2020, 06:17
|
|
Member
|
|
Join Date: Mar 2013
Posts: 477
|
|
Re: OH NO, firemonkey has been kidnapped!!!
I think I've figured it out now that I'm charged up with two strong cups of coffee.
I reckon Firemonkey could solve in three days maximum if Powdermonkey is unable to give an answer, in which case the answer would have to be 10 villages.
Day ONE – Firemonkey (FM) knows that Powdermonkey (PM) can only possibly see 6 – 13 villages. Now if PM is unable to answer, FM can also deduce that PM is not seeing 11,12,13 villages. Likewise, PM would know that FM is not seeing 11,12,13 villages. Okay, so FM now knows that PM can only see 6 – 10 villages.
Day TWO – If FM isn’t forthcoming with an answer, PM would now know that FM isn’t seeing 0,1,2 villages because if he did, he would have deduced that since PM isn’t seeing 11,12 or 13 villages, there must be 10 villages.
Day THREE – If PM can see 8, 9 or 10 villages and now knows that FM isn’t seeing 0,1 or 2 villages, then he would call 13 villages. If PM stays silent, then FM must know he is only able to see 6 or 7 villages and therefore there can only be 10 villages!
|