Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Five prisoners are arrested in a crime. But the jail is full and the police has nowhere to place them. So he comes up with

Five prisoners are arrested in a crime. But the jail is full and the police has nowhere to place them. So he comes up with this solution. He will give them a puzzle. If they succeed, all of them go free; otherwise they are transferred to another jail in another state. The police sets the 5 of them into a line and puts a hat on each one of them. He explains to them that there are exactly 3 black hats and 3 white hats. The rule for the puzzle is simple. If at least two of the prisoners can figure out the color of their own hat in 45 seconds, all of them can go free. Prisoner A can see prisoners B, C, D, and E. Prisoner B can see prisoners C, D, E. Prisoner C can see prisoners D and E. Prisoner D can only see prisoner E. Prisoner E cannot see anyone. And none of them can see their own hat. After 15 seconds one of the prisoners blurts out I know the color of my 1 hat. After another 15 seconds, another prisoner blurts out the same words. Which two prisoners are they and how do they find out?

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Object Oriented Databases Prentice Hall International Series In Computer Science

Authors: John G. Hughes

1st Edition

0136298745, 978-0136298748

More Books

Students also viewed these Databases questions