{"id":1026,"date":"2006-09-14T21:51:00","date_gmt":"2006-09-14T21:51:00","guid":{"rendered":"http:\/\/www.edunik.com\/home\/?p=1026"},"modified":"2006-09-14T21:51:00","modified_gmt":"2006-09-14T21:51:00","slug":"puzzle-two-very-difficult-cases-can-you-solve-them-the-answer","status":"publish","type":"post","link":"http:\/\/edunik.com\/home\/?p=1026","title":{"rendered":"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)"},"content":{"rendered":"<p><span style=\"color: #9acd32;\"><span style=\"font-weight: bold; font-size: medium;\">INTRO<\/span><\/span><\/p>\n<p>Well, I love puzzles and difficult math questions. But these two are very special for me.<br \/>\nThey made me :<\/p>\n<ul>\n<li>realized that there are <span style=\"color: #ff0000;\">PROBLEMS only possible to answer by analyzing what other people think or say or do<\/span>.<\/li>\n<li>realized that when people say something to you, there are messages (somethime it is hidden) in their words.<\/li>\n<li>realized that you need to listen to (not hear) people, because what they say might contain some part of answer you&#8217;re looking for.<\/li>\n<\/ul>\n<p>Here&#8217;s the answer, and again, for BAHASA, pls see below.<\/p>\n<p><span style=\"font-weight: bold; font-size: medium;\"><span style=\"color: #9acd32;\">ANSWER TO FIRST QUESTION<\/span><\/span><\/p>\n<p>Let&#8217;s assume that person in the back = C, in the middle = B, in the front= A.<\/p>\n<p>The key to answer this question is to understand that there is &#8216;something&#8217; in someone&#8217;s words.<\/p>\n<p><span style=\"text-decoration: underline; font-weight: bold;\">PART 1 &#8211; What C said<\/span><\/p>\n<p>The ONLY combination that C would know his hat is if C saw both A and B wear BLUE (because there were only TWO BLUE hats, so C would know he wears RED).<\/p>\n<p>So, C would see one of these combination (ZERO BLUE or ONE BLUE) :<br \/>\nAlternative 1 : A-RED B-RED<br \/>\nAlternative 2 : A-RED B-BLUE<br \/>\nAlternative 3 : A-BLUE B-RED<\/p>\n<p><span style=\"font-weight: bold; text-decoration: underline;\">PART 2 &#8211; What B said<\/span><\/p>\n<p>B (and you) would know now, the possible combination of A &amp; B caps are :<br \/>\nAlternative 1 : A-RED B-RED<br \/>\nAlternative 2 : A-RED B-BLUE<br \/>\nAlternative 3 : A-BLUE B-RED<\/p>\n<p>Look at the combination!<br \/>\nIf B saw A wear BLUE, then B will know his\/her hat is RED.<\/p>\n<p>B looked A&#8217;s hat, and B still didn&#8217;t know what color his\/her cap was.<\/p>\n<p>So, you (and A) must realise that the possible combinations are :<br \/>\n1. A-RED B-RED, and<br \/>\n2. A-RED B-BLUE<\/p>\n<p>In both scenario, A will wear RED. So he knew it!!<\/p>\n<p><span style=\"font-weight: bold; text-decoration: underline;\"><span style=\"color: #9acd32;\">SECOND QUESTION<\/span><\/span><\/p>\n<p>Aaaah&#8230; this is very difficult, even only to understand it.<\/p>\n<p>Let&#8217;s begin with the the fact that all monks <span style=\"color: #ff0000;\">can see other monks&#8217; forehead<\/span>, but not their own forehead.<\/p>\n<p>&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br \/>\n<span style=\"font-weight: bold; color: #ff0000;\">Case A. Let&#8217;s Assume : There is ONLY <span style=\"text-decoration: underline;\">ONE<\/span> monk who has RED-mark (X=1)<\/span><\/p>\n<p><span style=\"text-decoration: underline;\">Day 1<\/span><\/p>\n<ul>\n<li>There are <span style=\"color: #ff0000;\">49<\/span> monks that will see ONE person has RED mark in the forehead (monks with BLUE mark)<\/li>\n<li>There is <span style=\"color: #ff0000;\">1<\/span> monk that will see there is nobody has RED mark (this is the monk with RED mark)<\/li>\n<li>So at Day 1-Midnight, this 1 monk (who see no one with RED mark) will leave the hall.<\/li>\n<li>Case closed.<\/li>\n<\/ul>\n<p>&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br \/>\n<span style=\"color: #ff0000; font-weight: bold;\">Case B. Let&#8217;s Assume : There are <span style=\"text-decoration: underline;\">TWO<\/span> monks who has RED-mark (X=2)<\/span><\/p>\n<p><span style=\"text-decoration: underline;\">Day 1<\/span><\/p>\n<ul>\n<li>There are <span style=\"color: #ff0000;\">48<\/span> monks (with Blue mark) that will see TWO persons have RED mark in the forehead.<\/li>\n<li>There are <span style=\"color: #ff0000;\">2<\/span> monks (with Red mark) that will see ONE person has RED mark.<\/li>\n<li>But these 2 monks cannot conclude they must leave the hall, since there might be possibility of &#8220;Only 1 monk has RED mark&#8221; (like we analyse in Case A)<\/li>\n<li>So at Day 1-Midnight, NOBODY will leave the hall.<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Day 2<\/span><\/p>\n<ul>\n<li>NOBODY left yesterday. All monks now understand that there must be more than 1 RED mark.<\/li>\n<li>And all the monks know that this means : whoever see 1 (X minus 1) mark, must leave tonight.<\/li>\n<li>So at Day 2-Midnight, TWO monks (those who see 1 RED Mark) will leave the hall.<\/li>\n<li>Case closed.<\/li>\n<\/ul>\n<p>&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br \/>\n<span style=\"color: #ff0000; font-weight: bold;\">Case C. Let&#8217;s Assume : There are <span style=\"text-decoration: underline;\">THREE<\/span> monks who has RED-mark (X=3)<\/span><\/p>\n<p><span style=\"text-decoration: underline;\">Day 1<\/span><\/p>\n<ul>\n<li>There are <span style=\"color: #ff0000;\">47<\/span> monks that will see THREE persons have RED mark in the forehead.<\/li>\n<li>There are <span style=\"color: #ff0000;\">3<\/span> monks that will see TWO person has RED marks.<\/li>\n<li>So at Day 1-Midnight, NOBODY will leave the hall.<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Day 2<\/span><\/p>\n<ul>\n<li>NOBODY left. All monks now understand that there must be more than 1 RED mark.<\/li>\n<li>And all the monks know that this means : whoever see 1 mark, must leave tonight.<\/li>\n<li>However, nobody sees only 1 mark.<\/li>\n<li>So at Day 2-Midnight, nobody leaves the hall.<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\"><br \/>\nDay 3<\/span><\/p>\n<ul>\n<li>NOBODY LEFT AGAIN! All monks now understand that there must be more than 2 RED mark.<\/li>\n<li>And all the monks know that this means : whoever see 2 (X minus 1) mark, must leave tonight.<\/li>\n<li>So at Day 2-Midnight, THREE monks (that see 2 RED Mark) will leave the hall.<\/li>\n<li>Case closed.<\/li>\n<\/ul>\n<p>&#8212;<\/p>\n<p>So we can continue this, we can conclude :<\/p>\n<ul>\n<li>Then, at day number X, at midnight, all of RED-marked-forehead monk(s) will leave the hall at the same time.<\/li>\n<li>This\/these monk(s) is\/are monk(s) that would see there is\/are (X minus 1) RED mark(s) in the 49 monk&#8217;s forehead.<\/li>\n<\/ul>\n<p>Amazing huh? But can you imagine if there&#8217;s one monk who doesn&#8217;t understand the whole concept? It will ruin everthing, cause no one will ever leave the building<\/p>\n<p>=====================<\/p>\n<p><strong>JAWABAN PERTANYAAN 1<\/strong><\/p>\n<p>Kita sebut orang di belakang= C, di tengah = B, di depan = A.<\/p>\n<p>Kunci menjawab ini adalah menyadari bahwa ada sesuatu di omongan\/jawaban seseorang.<\/p>\n<p>PART 1 &#8211; Jawaban si C<\/p>\n<p>Si C pasti tahu dia pakai topi warna apa kalau dia liat kedua teman di depan pakai BIRU.<br \/>\nKenapa? Karena cuma ada DUA topi BIRU. Jadi kalau dia liat, pasti tahu dia pakai warna MERAH.<\/p>\n<p>Jadi pastilah si C itu lihat SATU BIRU atau DUA BIRU. Ada tiga alternatif :<\/p>\n<p>Alternative 1 : A pakai MERAH, B pakai MERAH<br \/>\nAlternative 2 : A pakai MERAH, B pakai BIRU<br \/>\nAlternative 3 : A pakai BIRU, B pakai MERAH<\/p>\n<p>PART 2 &#8211; Jawaban si B<\/p>\n<p>B (dan Anda) tahu dong kombinasi di atas, dari jawaban si C.<\/p>\n<p>Lihat kembali kombinasinya, kalau B melihat si A pakai BIRU, dia tahu topinya MERAH.<br \/>\nKarena di tiga alternatif itu hanya satu skenario yang A pakai BIRU.<\/p>\n<p>Namun B tidak tahu kan? Jadi Anda (dan si A) pasti tahu kombinasi yang tertinggal adalah 1. A pakai MERAh, B pakai MERAH<br \/>\n2. A pakai MERAH, B pakai BIRU<\/p>\n<p>Di kedua alternatif, topi A warnanya &#8230; MERAH! Makanya dia tahu.<\/p>\n<p><strong>PERTANYAAN KEDUA<\/strong><\/p>\n<p>Tarik nafas.. ini susah.<\/p>\n<p>Fakta penting : semua calon biksu TIDAK BISA lihat dahinya sendiri tapi BISA melihat dahi orang lain!!!<\/p>\n<p>&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<\/p>\n<p>Skenario A. Mari berandai, cuma SATU calon biksu yang dapat merah di dahinya (X=1)<\/p>\n<p>Day 1<\/p>\n<ul>\n<li>Berarti ada 49 calon biksu yang melihat 1 orang berdahi MERAH.<\/li>\n<li>Berarti ada 1 calon biksu yang melihat semua orang berdahi biru.<\/li>\n<li>Maka, di malam hari, si 1 calon biksu itu pergi, karena dia tahu tidak semua lolos.<\/li>\n<li>Case closed.<\/li>\n<\/ul>\n<p>&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br \/>\nSkenario B. Mari berandai, ada DUA calon biksu yang dapat merah di dahinya (X=2)<\/p>\n<p>Day 1<\/p>\n<ul>\n<li>Ada 48 calon biksu yang melihat 2 orang berdahi MERAH<\/li>\n<li>Ada 2 calon biksu yang melihat 1 orang berdahi MERAH<\/li>\n<li>Namun 2 calon biksu ini tidak pergi malam itu, karena merasa bisa saja cuma 1 calon biksu yang dapat MERAH<\/li>\n<\/ul>\n<p>Day 2<\/p>\n<ul>\n<li>TIDAK ADA yang pergi semalam.<\/li>\n<li>Semua calon biksu jadi tahu, ada lebih dari 1 yang berdahi MERAH.<\/li>\n<li>Dan semua jadi tahu, siapa pun yang lihat 1 orang berdahi MERAH harus pergi.<\/li>\n<li>Di malamnya, 2 calon biksu pergi.<\/li>\n<\/ul>\n<p>&#8212;<\/p>\n<p>Ngerti kan?<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>INTRO Well, I love puzzles and difficult math questions. But these two are very special for me. They made me : realized that there are PROBLEMS only possible to answer by analyzing what other people think or say or do. realized that when people say something to you, there are messages (somethime it is hidden) <a href=\"http:\/\/edunik.com\/home\/?p=1026\"> read more <span class=\"meta-nav\">&raquo;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ngg_post_thumbnail":0,"spay_email":"","footnotes":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false},"categories":[7],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v17.0 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"http:\/\/edunik.com\/home\/?p=1026\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)\" \/>\n<meta property=\"og:description\" content=\"INTRO Well, I love puzzles and difficult math questions. But these two are very special for me. They made me : realized that there are PROBLEMS only possible to answer by analyzing what other people think or say or do. realized that when people say something to you, there are messages (somethime it is hidden) read more &raquo;\" \/>\n<meta property=\"og:url\" content=\"http:\/\/edunik.com\/home\/?p=1026\" \/>\n<meta property=\"og:site_name\" content=\"our digital sanctuary\" \/>\n<meta property=\"article:published_time\" content=\"2006-09-14T21:51:00+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"e2rd_san\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebSite\",\"@id\":\"http:\/\/edunik.com\/home\/#website\",\"url\":\"http:\/\/edunik.com\/home\/\",\"name\":\"our digital sanctuary\",\"description\":\"to share what inspires and reminds us what a wonderful life God has given us\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/edunik.com\/home\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"http:\/\/edunik.com\/home\/?p=1026#webpage\",\"url\":\"http:\/\/edunik.com\/home\/?p=1026\",\"name\":\"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)\",\"isPartOf\":{\"@id\":\"http:\/\/edunik.com\/home\/#website\"},\"datePublished\":\"2006-09-14T21:51:00+00:00\",\"dateModified\":\"2006-09-14T21:51:00+00:00\",\"author\":{\"@id\":\"http:\/\/edunik.com\/home\/#\/schema\/person\/6fd0f27ba7e37c14d1137aa81908dcae\"},\"breadcrumb\":{\"@id\":\"http:\/\/edunik.com\/home\/?p=1026#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"http:\/\/edunik.com\/home\/?p=1026\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"http:\/\/edunik.com\/home\/?p=1026#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/edunik.com\/home\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)\"}]},{\"@type\":\"Person\",\"@id\":\"http:\/\/edunik.com\/home\/#\/schema\/person\/6fd0f27ba7e37c14d1137aa81908dcae\",\"name\":\"e2rd_san\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"http:\/\/edunik.com\/home\/#personlogo\",\"inLanguage\":\"en-US\",\"url\":\"http:\/\/0.gravatar.com\/avatar\/342fe025e1273187492c7448dd1e4004?s=96&d=mm&r=g\",\"contentUrl\":\"http:\/\/0.gravatar.com\/avatar\/342fe025e1273187492c7448dd1e4004?s=96&d=mm&r=g\",\"caption\":\"e2rd_san\"},\"url\":\"http:\/\/edunik.com\/home\/?author=2\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"http:\/\/edunik.com\/home\/?p=1026","og_locale":"en_US","og_type":"article","og_title":"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)","og_description":"INTRO Well, I love puzzles and difficult math questions. But these two are very special for me. They made me : realized that there are PROBLEMS only possible to answer by analyzing what other people think or say or do. realized that when people say something to you, there are messages (somethime it is hidden) read more &raquo;","og_url":"http:\/\/edunik.com\/home\/?p=1026","og_site_name":"our digital sanctuary","article_published_time":"2006-09-14T21:51:00+00:00","twitter_card":"summary","twitter_misc":{"Written by":"e2rd_san","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebSite","@id":"http:\/\/edunik.com\/home\/#website","url":"http:\/\/edunik.com\/home\/","name":"our digital sanctuary","description":"to share what inspires and reminds us what a wonderful life God has given us","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/edunik.com\/home\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"WebPage","@id":"http:\/\/edunik.com\/home\/?p=1026#webpage","url":"http:\/\/edunik.com\/home\/?p=1026","name":"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)","isPartOf":{"@id":"http:\/\/edunik.com\/home\/#website"},"datePublished":"2006-09-14T21:51:00+00:00","dateModified":"2006-09-14T21:51:00+00:00","author":{"@id":"http:\/\/edunik.com\/home\/#\/schema\/person\/6fd0f27ba7e37c14d1137aa81908dcae"},"breadcrumb":{"@id":"http:\/\/edunik.com\/home\/?p=1026#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["http:\/\/edunik.com\/home\/?p=1026"]}]},{"@type":"BreadcrumbList","@id":"http:\/\/edunik.com\/home\/?p=1026#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/edunik.com\/home\/"},{"@type":"ListItem","position":2,"name":"[puzzle] Two DIFFICULT Cases, Can You Solve Them? (the ANSWER)"}]},{"@type":"Person","@id":"http:\/\/edunik.com\/home\/#\/schema\/person\/6fd0f27ba7e37c14d1137aa81908dcae","name":"e2rd_san","image":{"@type":"ImageObject","@id":"http:\/\/edunik.com\/home\/#personlogo","inLanguage":"en-US","url":"http:\/\/0.gravatar.com\/avatar\/342fe025e1273187492c7448dd1e4004?s=96&d=mm&r=g","contentUrl":"http:\/\/0.gravatar.com\/avatar\/342fe025e1273187492c7448dd1e4004?s=96&d=mm&r=g","caption":"e2rd_san"},"url":"http:\/\/edunik.com\/home\/?author=2"}]}},"jetpack_featured_media_url":"","jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p3jLlq-gy","_links":{"self":[{"href":"http:\/\/edunik.com\/home\/index.php?rest_route=\/wp\/v2\/posts\/1026"}],"collection":[{"href":"http:\/\/edunik.com\/home\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/edunik.com\/home\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/edunik.com\/home\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/edunik.com\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1026"}],"version-history":[{"count":0,"href":"http:\/\/edunik.com\/home\/index.php?rest_route=\/wp\/v2\/posts\/1026\/revisions"}],"wp:attachment":[{"href":"http:\/\/edunik.com\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1026"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/edunik.com\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1026"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/edunik.com\/home\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1026"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}