<meta name='google-adsense-platform-account' content='ca-host-pub-1556223355139109'/> <meta name='google-adsense-platform-domain' content='blogspot.com'/> <!-- data-ad-client=ca-pub-2799935330569724 --> <!-- --><style type="text/css">@import url(https://www.blogger.com/static/v1/v-css/navbar/3334278262-classic.css); div.b-mobile {display:none;} </style> </head><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\x3d24422183\x26blogName\x3dTech+at+the+speed+of+Warp\x26publishMode\x3dPUBLISH_MODE_BLOGSPOT\x26navbarType\x3dBLACK\x26layoutType\x3dCLASSIC\x26searchRoot\x3dhttps://nccwarp9.blogspot.com/search\x26blogLocale\x3den_US\x26v\x3d2\x26homepageUrl\x3dhttp://nccwarp9.blogspot.com/\x26vt\x3d2845469267604558330', where: document.getElementById("navbar-iframe-container"), id: "navbar-iframe" }); } }); </script>
0 comments | Sunday, November 12, 2006

Thinking Machine 4

Ever since the dawn of computers man played chess with them and in 1997 IBM Big Blue was the first computer that won a match with a world champion, Garry Kasparov.

Chess programing algorithms are one of basic algorithms every programmer learns sooner or later. Along side the traveling salesman problem chess problems are usual problem posed to high school student on computer programing competitions.

One of interesting sites actually shows the generation of paths inside the algorithm or the "thinking" process of the computer, Thinking Machine 4.

Labels: ,

0 Comments:

Post a Comment

<< Home