Tuesday, December 15, 2009

Good Guys / Bad Guys

There are 6 men, 3 good and 3 bad. They stand on the east side of a very deep chasm. An electrified (untouchable) cable spans the chasm from which hangs a little car (which luckily is also on the east side). The car can transport one or two men from one side of the chasm to the other, but can't span the distance unmanned. If at any point the bad guys outnumber the good guys, they will kill the good guys. I.E. if a good guy and bad guy are in the cable car, traveling towards a side on which there is only a bad guy, then when they arrive the good guy will be outnumbered and will surely die.

How can everyone get across the chasm alive (such that all six men are on the west side at the same time) using only the car? (No funny business with the cable or alternate routes across the chasm.)

Solution in ASCII-HEX. (here's a converter)

49 66 20 79 6F 75 20 76 69 65 77 20 74 68 65 20 66 6F 6C 6C 6F 77 69 6E 67 20 69 6E 20 61 20 6D 6F 6E 6F 73 70 61 63 65 20 66 6F 6E 74 2C 20 69 74 20 73 68 6F 75 6C 64 20 6D 61 6B 65 20 73 65 6E 73 65 2E 1F 1F 20 20 20 20 2D 2D 20 2D 2D 2D 2D 20 67 67 67 62 62 62 1F 20 20 20 20 2D 2D 20 3C 2D 62 62 20 67 67 67 62 1F 20 20 20 20 62 62 20 2D 2D 2D 2D 20 67 67 67 62 1F 20 20 20 20 20 62 20 62 2D 3E 20 20 67 67 67 62 1F 20 20 20 20 20 62 20 2D 2D 2D 2D 20 67 67 67 62 62 1F 20 20 20 20 20 62 20 3C 2D 62 62 20 67 67 67 1F 20 20 20 62 62 62 20 2D 2D 2D 2D 20 67 67 67 1F 20 20 20 20 62 62 20 62 2D 3E 20 20 67 67 67 1F 20 20 20 20 62 62 20 2D 2D 2D 2D 20 67 67 67 62 1F 20 20 20 20 62 62 20 3C 2D 67 67 20 67 62 1F 20 20 67 67 62 62 20 2D 2D 2D 2D 20 67 62 1F 20 20 20 20 67 62 20 67 62 2D 3E 20 67 62 1F 20 20 20 20 67 62 20 2D 2D 2D 2D 20 67 67 62 62 1F 20 20 20 20 67 62 20 3C 2D 67 67 20 62 62 1F 20 20 67 67 67 62 20 2D 2D 2D 2D 20 62 62 1F 20 20 20 67 67 67 20 62 2D 3E 20 20 62 62 1F 20 20 20 67 67 67 20 2D 2D 2D 2D 20 62 62 62 1F 20 20 20 67 67 67 20 3C 2D 62 62 20 62 1F 20 67 67 67 62 62 20 2D 2D 2D 2D 20 62 1F 20 20 67 67 67 62 20 62 2D 3E 20 20 62 1F 20 20 67 67 67 62 20 2D 2D 2D 2D 20 62 62 1F 20 20 67 67 67 62 20 3C 2D 62 62 20 2D 2D 1F 67 67 67 62 62 62 20 2D 2D 2D 2D 20 2D 2D
{ "loggedin": false, "owner": false, "avatar": "", "render": "nothing", "trackingID": "UA-36983794-1", "description": "Deductive puzzle: cross the obstacle while restricting who can traverse and who can remain.", "page": { "blogIds": [ 31 ] }, "domain": "holtstrom.com", "base": "\/michael", "url": "https:\/\/holtstrom.com\/michael\/", "frameworkFiles": "https:\/\/holtstrom.com\/michael\/_framework\/_files.4\/", "commonFiles": "https:\/\/holtstrom.com\/michael\/_common\/_files.3\/", "mediaFiles": "https:\/\/holtstrom.com\/michael\/media\/_files.3\/", "tmdbUrl": "http:\/\/www.themoviedb.org\/", "tmdbPoster": "http:\/\/image.tmdb.org\/t\/p\/w342" }