AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
Computer go chess engine online4/12/2024 ![]() It’s only fitting, then, that Intel became the first corporation to sponsor a world championship chess match, when Garry Kasparov and Nigel Short founded a shortlived Professional Chess Association as a rival to the traditional International Chess Federation in 1993.Ĭhess became even more important for the branding of Intel’s iconic competitor. As one barrier after another fell to the ingenuity of Intel and its rivals, it seemed reasonable to conclude that if you didn’t see a way forward you weren’t thinking hard enough. It implied that there was a solution for every physical and chemical obstacle that skeptics raised about it over the years. Intentionally or not, Moore’s prediction became what has often been called, in the phrase of the sociologist Robert Merton, a self-fulfilling prophecy. Even jet airliners’ speeds hit a wall within decades of the first flight, as the commercial failure of the supersonic Concorde in 2003 would demonstrate. ![]() And in the modern era, the pace of rail and auto travel rapidly reached practical plateaus. Napoleon’s armies, after all, had covered no more distance per day than Caesar’s almost two millennia earlier. And while Moore was hardly the first tech entrepreneur to make bold predictions about the wonders awaiting us, his landmark paper was the first to foresee growth in exponential terms - and on a timetable previously unimagined. He created one of the most formidable and longest-running challenges in the history of technology. (Decades later, world champion Garry Kasparov defeated the program in just 16 moves but called the program “an incredible achievement.”) Within two decades, though, hardware was beginning to catch up with Turing’s vision and that of later artificial intelligence pioneers.Įnter Gordon Moore, cofounder of Intel, who predicted in 1965 that the number of electronic switches (transistors) that could be packed onto a microprocessor would double every 24 months with commensurate improvement in execution speed. It took 30 minutes for each move and the algorithm lost - but Turing had proved that a program could play a game to the end. In 1951, he used a printout of his code to play a virtual computer against a human opponent. Alan Turing, the mathematician whose PhD dissertation built the foundation of modern computer theory, prized the game as a test of the power of algorithms even before technology existed that could execute them. Chess has been linked to computer science ever since the latter’s birth as a discipline.
0 Comments
Read More
Leave a Reply. |