﻿<!--<!DOCTYPE nitf SYSTEM "nitf-3-4.dtd">-->
<nitf>
  <head>
    <title id="Title">&amp; çâÌæÚUæð´ ·¤è ¥ôÚU Îð¹Ùæ ÁæÚUè ÚU¹ð´ ¥ÍæüÌ ¥ÂÙð ÜÿØ ÂÚU ŠØæÙ ÚU¹ð´Ð ãæÚU Ù ×æÙð´, €UØô´ç·¤ ·¤æ× ·¤ÚUÙð âð ¥æÂ·¤ô ©gðàØ ·¤è Âýæç# ãôÌè ãñ ¥õÚU ÁèßÙ ·¤æ ¹æÜèÂÙ ÎêÚU ãôÌæ ãñÐ ÖÜð ãè ÁèßÙ ×ð´ ç·¤ÌÙè Öè ·¤çÆÙæ§ü €UØô´ Ù ¥æ°, çÁ™ææâæ ¥õÚU ©ˆâæã ÕÙæ° ÚU¹ð´Ð ŠØæÙ ÚU¹ð´, ÜÿØ ã×ðàææ ¥æÂ·Ô¤ Âæâ ãôÌð ãñ´ çÁ‹ãð´ ÂæÙð ·Ô¤ çÜ° ÂýØæâ ¥æÂ ·¤Öè Öè àæéM¤ ·¤ÚU â·¤Ìð ãñ´Ð</title>
    <docdata management-doc-idref="">
      <date.issue id="CreationDate" norm="" />
      <du-key id="rev-ver" generation="1" version="Default" />
      <du-key id="Parent-Version" version="" />
      <identified-content>
        <classifier id="newspro-nitf" value="r2" />
        <classifier id="Newspro-App" value="Epaper" />
        <classifier id="Content-Type" value="Story" />
        <classifier id="storyID" value="" />
        <classifier id="CmsConID" value="" />
        <classifier id="Desk" value="" />
        <classifier id="Source" value="" />
        <classifier id="Edition" value="" />
        <classifier id="Category" value="-1" />
        <classifier id="UserName" value="" />
        <classifier id="PublicationDate" value="20220103" />
        <classifier id="PublicationName" value="Hindustan" />
        <classifier id="IsPublished" value="Y" />
        <classifier id="IsPlaced" value="Y" />
        <classifier id="IsCompleated" value="N" />
        <classifier id="IsProofed" value="N" />
        <classifier id="User" value="" />
        <classifier id="Headline-Count" value="" />
        <classifier id="Slug-Count" value="0" />
        <classifier id="Photo-Count" value="0" />
        <classifier id="Caption-Count" value="0" />
        <classifier id="Word-Count" value="0" />
        <classifier id="Character-Count" value="0" />
        <classifier id="Location" value="" />
        <classifier id="TemplateType" value="1" />
        <classifier id="StoryType" value="Story" />
        <classifier id="Author" value="" />
        <classifier id="UOM" value="mm" />
        <classifier id="IndexPage" value="" />
        <classifier id="box-geometry" value="-7,40,950,284" />
        <classifier id="Epaper-Build" value="Build-No: 2.1.0.9, Dated: 04/12/2021" />
        <classifier id="Application" value="QuarkXpress 8" />
        <classifier id="MachineName" value="TV0254" />
        <classifier id="ProcessingDateTime" value="Mon 03 Jan 2022 07:00:24" />
      </identified-content>
      <urgency id="home-page" ed-urg="0" />
      <urgency id="priority" ed-urg="0" />
      <doc-scope id="scope" value="0" />
    </docdata>
    <pubdata type="print" name="Hindustan" date.publication="20220103T000000+5.30" edition.name="RPAjmCity" edition.area="RPAjmCity" position.section="03012022-RPAjmCity-01-PAGE-03012022_RPAjmCity_01~WS4~" position.sequence="01" ex-ref="03012022-RPAjmCity-01-PAGE-03012022_RPAjmCity_01~WS4~" SectionName="" />
  </head>
  <body>
    <body.head>
      <hedline>
        <hl1 id="kicker" class="1" style="Shoulder" MainHead="false">
          <lang class="3" style="kicker" font="Patrika18" size="12">
</lang>
        </hl1>
        <hl1 id="Headline" class="1" style="Headline" MainHead="true">
          <lang class="3" style="Headline" font="Patrika18" fontStyle="Bold" size="15">Checkered in a billion billion moves?
</lang>
        </hl1>
        <hl1 id="Subhead" class="1" style="Subhead" MainHead="true">
          <lang class="3" style="Subhead" font="Patrika18" fontStyle="Bold" size="15">
</lang>
        </hl1>
        <hl1 id="Byline" class="1" style="Byline" MainHead="true">
          <lang class="3" style="Byline" font="Patrika18" fontStyle="Bold" size="15">
</lang>
        </hl1>
      </hedline>
      <summary></summary>
      <quotes>
        <quote></quote>
      </quotes>
    </body.head>
    <body.content id="Bodytext">
      <block>
        <media id="1" media-type="image">
          <media-reference id="tn" source-credit="" data-location="1" ImgOrderNum="" source="03012022-RPAjmCity-01-PAGE-03012022_RPAjmCity_01~WS4~_SubGroupImage_720446704_tn.JPG" Units="pixels" width="50" height="50"></media-reference>
          <media-caption id="Caption1" font="">
            <hl2></hl2>
          </media-caption>
          <media-reference id="tn" source-credit="" data-location="2" ImgOrderNum="" source="03012022-RPAjmCity-01-PAGE-03012022_RPAjmCity_01~WS4~_SubGroupImage_720325568_tn.JPG" Units="pixels" width="50" height="50"></media-reference>
          <media-caption id="Caption1" font="">
            <hl2></hl2>
          </media-caption>
          <media-reference id="tn" source-credit="" data-location="3" ImgOrderNum="" source="03012022-RPAjmCity-01-PAGE-03012022_RPAjmCity_01~WS4~_SubGroupImage_720436736_tn.JPG" Units="pixels" width="50" height="50"></media-reference>
          <media-caption id="Caption1" font="">
            <hl2></hl2>
          </media-caption>
          <media-reference id="tn" source-credit="" data-location="4" ImgOrderNum="" source="03012022-RPAjmCity-01-PAGE-03012022_RPAjmCity_01~WS4~_SubGroupImage_715957792_tn.JPG" Units="pixels" width="50" height="50"></media-reference>
          <media-caption id="Caption1" font="">
            <hl2></hl2>
          </media-caption>
          <media-reference id="tn" source-credit="" data-location="5" ImgOrderNum="" source="03P1 StephenHawkings_tn.JPG" Units="pixels" width="50" height="50"></media-reference>
          <media-caption id="Caption1" font="">
            <hl2></hl2>
          </media-caption>
        </media>
      </block>
      <p style=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">The game of English draughts, or American checkers, is more complex than it may seem at first sight. Rashida Ahmad takes a look at what it takes to solve a game with 500 billion billion variations
</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">We have a good claim to having invented chess in this part of the world, which is perhaps why the game of English draughts, or American checkers, is seen somewhat as the poorer cousin in the subcontinent. After all, the rules of draughts could hardly be simpler, could they? But, that's not to say we should look on it as a simplistic game. Draughts has roughly 500 billion billion (5x1020) possible positions, which means "solving the game" is no mean task. In fact one computer program has been trying to do so almost continuously for nearly two decades.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">Now, computer scientists at the University of Alberta in Canada have announced that draughts has finally been solved. But what exactly does that mean? Well, solving a game like draughts means "determining the final result in a game with no mistakes made by either player," according to professor of computer science, Jonathan Schaeffer and his team. Their paper, published last month in the journal Science, claims that "perfect play by both sides leads to a draw."</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">The computer program that allows them to make this claim is called Chinook, and was first developed in 1989 by Dr Schaeffer to try and beat the world's best draughts players. Running on as many as 200 computers simultaneously at times, it first began beating champion players in 1994. But Schaeffer and his team of computer scientists claim that no one can possibly beat Chinook at draughts today -- the best human player can only ever draw.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">Simply put, the program reduces draughts to something resembling a vast game of noughts and crosses, for which the perfect strategy for a win or draw (that is, for never losing) can be explained to a child. But draughts, with its 500 billion billion possibilities compared with only 765 in noughts and crosses, is the most complex game that has been solved to date. Even for Chinook, however, it would have been impossible in practical terms to process moves for all 5x1020 board positions.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">"It's a computational proof," says Schaeffer. "It's certainly not a formal mathematical proof."</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">That means there is no set of equations that can be applied for every possible play, and at the same it would be impossible to check every calculation Chinook might make. Chinook did not in fact need to go through every single one of the 500 billion billion possible moves -- not all losing plays needed to be analysed, for example. In the end, only 1/5,000,000 of the moves needed to be computed.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">The solvability of a board game generally depends on two factors: the number of possible positions, or "state-space complexity," and the difficulty of deciding on the best move, or "decision complexity." Noughts and crosses is simple on both counts. Checkers is complex in both regards.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">As for chess, it is obviously harder to solve than checkers, with a state-space complexity of 1046. Decision complexity in chess is difficult to quantify, but it is clearly very high. Artificial intelligence has created game-playing programmes, such as DEEP BLUE for chess. But solving a game means achieving perfection in chess. Until recently this was thought to be impossible, as mathematicians and programmers considered chess to be an "infinite game." But Chinook is now considered a significant step towards finding such a solution. Nevertheless, Schaeffer says new tools are needed before that can happen.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">"Chess and Go cannot be solved with the type of technology that we have today," he says. The game of Go, played on a 19 by 19 grid, is considered by many to be the hardest conventional game to crack, with approximately 10100 possible positions.</lang>
      </p>
      <p class=".Bodylaser">
        <lang class="3" style=".Bodylaser" font="Patrika15 Ultra" fontStyle="Bold" size="130">In fact Dr. Schaeffer is taking a shot at cracking poker next -- a whole new game in which opponents' positions are not openly revealed. His program Polaris is currently taking on world champion poker players in Texas Hold 'Em poker. What the stakes might be is anyone's guess!</lang>
      </p>
    </body.content>
  </body>
</nitf>