<body><script type="text/javascript"> function setAttributeOnload(object, attribute, val) { if(window.addEventListener) { window.addEventListener('load', function(){ object[attribute] = val; }, false); } else { window.attachEvent('onload', function(){ object[attribute] = val; }); } } </script> <div id="navbar-iframe-container"></div> <script type="text/javascript" src="https://apis.google.com/js/platform.js"></script> <script type="text/javascript"> gapi.load("gapi.iframes:gapi.iframes.style.bubble", function() { if (gapi.iframes && gapi.iframes.getContext) { gapi.iframes.getContext().openChild({ url: 'https://www.blogger.com/navbar.g?targetBlogID\x3d11927830\x26blogName\x3dLazy+Desis+are+still+lazy!\x26publishMode\x3dPUBLISH_MODE_BLOGSPOT\x26navbarType\x3dBLACK\x26layoutType\x3dCLASSIC\x26searchRoot\x3dhttps://lazydesi.blogspot.com/search\x26blogLocale\x3den_US\x26v\x3d2\x26homepageUrl\x3dhttp://lazydesi.blogspot.com/\x26vt\x3d-840655987791712217', where: document.getElementById("navbar-iframe-container"), id: "navbar-iframe" }); } }); </script>
blah

Laziness is nothing more than the habit of resting before you get tired. - Jules Renard 

Saturday, June 18, 2005

20 Questions

20Q.net - Play 20 Questions against the computer with this artificial intelligence version of Twenty Questions. "Everything that it knows and all questions that it asks were entered by people playing the Game." (The computer is well trained. Try real tough ones and you will be surprised with how it narrows it down).

  • Game theory suggests that the information (as measured by Shannon's entropy statistic) required to identify an arbitrary object is about 20 bits. The game is often used as an example when teaching people about information theory . Mathematically, if each question is structured to eliminate half the objects, twenty questions will allow the questioner to distinguish between 220 or 1,048,576 objects. Accordingly, the most effective strategy for Twenty Questions is to ask questions that will split the field of remaining possibilities roughly in half each time. The process is analogous to a binary tree search algorithm in computer science.



  • Post a Comment

    © Ramki 2005 - Powered by Blogger Templates