{"id":963,"date":"2026-02-22T15:16:26","date_gmt":"2026-02-22T15:16:26","guid":{"rendered":"https:\/\/shatranj.art\/?page_id=963"},"modified":"2026-02-23T11:10:10","modified_gmt":"2026-02-23T11:10:10","slug":"poster-17","status":"publish","type":"page","link":"https:\/\/shatranj.art\/am\/exhibit\/poster-17\/","title":{"rendered":"poster 17"},"content":{"rendered":"
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

The Knight’s Tour<\/b><\/h2>

Historical Depth:<\/b> The Knight’s Tour is a mathematical sequence in which a knight visits every single square on a chessboard exactly once. It is both a strategic challenge and a classic problem in recreational mathematics.<\/span><\/p>

\u00a0<\/p>

Origins:<\/b><\/p>

This problem is far from a modern discovery. The earliest known solutions date back to the 9th century, provided by masters from Baghdad such as Al-Adli and As-Suli. Furthermore, in 9th-century Indian literature, the Kashmiri poet Rudrata demonstrated this mathematical aesthetic in his work Kavyalankara, where he composed a poem that followed the sequence of a knight\u2019s tour.<\/p>

\u00a0<\/p>

Western Literature:<\/b><\/p>

In the 13th century, King Alfonso X of Castile featured complex maneuvers based on the knight’s movement in his famous Libro de los Juegos (Book of Games). However, the modern mathematical foundation of the problem was laid in 1759 by Leonhard Euler, whose analysis is now recognized as one of the cornerstones of Graph Theory.<\/p>

\u00a0<\/p>

Characteristics:<\/b><\/p>

Closed (Re-entrant) Tour:<\/b> If the knight finishes on a square that is exactly one knight’s move away from the starting square, allowing it to immediately begin the tour again.<\/p>

\u00a0<\/p>

Open Tour:<\/b><\/p>

If the knight visits every square but ends on a square from which it cannot reach the starting point in a single move.<\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

The 8 Queens Problem: Dijkstra and the Birth of Structured Programming<\/b><\/h2>

Posed by Max Bezzel in 1848 and drawing the attention of geniuses such as Carl Friedrich Gauss, this problem was transformed into a “programming manifesto” in the 1970s by one of the fathers of modern computer science, Edsger W. Dijkstra.<\/p>

The Connection Between Dijkstra and DFS<\/b><\/h3>

In his seminal work, <\/span>Notes on Structured Programming<\/span><\/i> (1972), Dijkstra utilized the 8 Queens Problem to demonstrate how an algorithm can be systematically constructed through a process he called “step-wise refinement.”<\/span><\/p>

  • DFS and Backtracking: Dijkstra defined the method of placing a queen in a row and descending to the next (Depth-First Search – DFS)\u00a0 and returning to the previous step to attempt a different possibility upon hitting a dead end (Backtracking)\u00a0 as the purest example of structured programming.<\/li><\/ul>

    The Power of Backtracking:<\/b><\/p>

    According to Dijkstra, this approach represents the first major milestone in refining the “trial-and-error” process into a flawless logical sequence that a co<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    The Wheat and Chessboard Problem: Exponential Growth<\/b><\/h3>

    Legend and Origin:<\/b><\/p>

    According to the story, when the inventor of chess, Sissa bin Dahir, presented the game to the King of India, the King asked him what reward he would like. Sissa made a seemingly modest request: “I want one grain of wheat for the first square of the chessboard, two for the second, four for the third, and for each subsequent square, twice the amount of the previous one.” The King initially dismissed this request, thinking it was just “a handful of wheat”; however, when the calculation began, it became clear that neither the treasury nor the world’s entire wheat stocks would be sufficient to fulfill this demand.<\/p>

    Historical Record: Ibn Khallikan (1256)<\/b><\/p>

    The first known written record of this famous story was documented in 1256 by the renowned biographer and historian Ibn Khallikan. Ibn Khallikan incorporated this event into his work not merely as a tale, but as evidence of how mathematics pushes the boundaries of the imagination.<\/p>

    Mathematical Reality:<\/b><\/p>

    This request made for the 64 squares on the chessboard is the purest example of geometric progression (exponential growth). The amount on each square is calculated using the formula 2n-1<\/sup><\/strong> . The equation providing the total amount of wheat is as follows:<\/span><\/p>

    \u00a0<\/p>

    S =<\/span>


    63<\/span>
    \u2211<\/span>
    i<\/i>=0<\/span>
    <\/span><\/p>

    2i<\/i><\/sup> = 264<\/sup> \u2212 1<\/span><\/p><\/div>

    The massive figure resulting from this calculation is:<\/p>

    18,446,744,073,709,551,615<\/b><\/p>

    Why Is It So Important?<\/b><\/p>

    • Scale of Growth:<\/b> This number is equivalent to approximately 2,000 times the current total annual wheat production of the world.\u00a0<\/span><\/li><\/ul>

      Strategic Lesson:<\/b> This problem is an ancient lesson of wisdom that teaches leaders and strategists how small changes (“doubling”) can transform into uncontrollable forces over time.<\/span><\/p><\/div><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"

      The Knight’s Tour Historical Depth: The Knight’s Tour is a mathematical sequence in which a knight visits every single square on a chessboard exactly once. It is both a strategic challenge and a classic problem in recreational mathematics. \u00a0 Origins: This problem is far from a modern discovery. The earliest known solutions date back to […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":743,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-963","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/pages\/963","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/comments?post=963"}],"version-history":[{"count":22,"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/pages\/963\/revisions"}],"predecessor-version":[{"id":1443,"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/pages\/963\/revisions\/1443"}],"up":[{"embeddable":true,"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/pages\/743"}],"wp:attachment":[{"href":"https:\/\/shatranj.art\/am\/wp-json\/wp\/v2\/media?parent=963"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}