{"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\/tr\/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

\u015e\u00f6valye Turu<\/b><\/h2>

Tarihsel Derinlik:<\/b> \u015e\u00f6valye Turu, bir \u015f\u00f6valyenin satran\u00e7 tahtas\u0131ndaki her bir kareyi tam olarak bir kez ziyaret etti\u011fi matematiksel bir dizidir. Hem stratejik bir meydan okuma hem de e\u011flence matemati\u011finde klasik bir problemdir.<\/span><\/p>

\u00a0<\/p>

K\u00f6kenleri:<\/b><\/p>

Bu problem modern bir ke\u015fif olmaktan \u00e7ok uzakt\u0131r. Bilinen en eski \u00e7\u00f6z\u00fcmler 9. y\u00fczy\u0131la kadar uzan\u0131r ve Al-Adli ve As-Suli gibi Ba\u011fdatl\u0131 ustalar taraf\u0131ndan sa\u011flanm\u0131\u015ft\u0131r. Ayr\u0131ca, 9. y\u00fczy\u0131l Hint edebiyat\u0131nda Ke\u015fmirli \u015fair Rudrata, bir \u015f\u00f6valyenin turunun s\u0131ras\u0131n\u0131 takip eden bir \u015fiir yazd\u0131\u011f\u0131 Kavyalankara adl\u0131 eserinde bu matematiksel esteti\u011fi g\u00f6stermi\u015ftir.<\/p>

\u00a0<\/p>

Bat\u0131 Edebiyat\u0131:<\/b><\/p>

13. y\u00fczy\u0131lda Kastilya Kral\u0131 X. Alfonso, \u00fcnl\u00fc Libro de los Juegos'unda (Oyunlar Kitab\u0131) \u015f\u00f6valyenin hareketine dayanan karma\u015f\u0131k manevralara yer vermi\u015ftir. Bununla birlikte, problemin modern matematiksel temeli 1759 y\u0131l\u0131nda Leonhard Euler taraf\u0131ndan at\u0131lm\u0131\u015ft\u0131r ve bu analiz g\u00fcn\u00fcm\u00fczde Grafik Teorisinin temel ta\u015flar\u0131ndan biri olarak kabul edilmektedir.<\/p>

\u00a0<\/p>

\u00d6zellikleri:<\/b><\/p>

Kapal\u0131 (Yeniden Giri\u015fli) Tur:<\/b> At, ba\u015flang\u0131\u00e7 karesinden tam olarak bir at hamlesi uzakta olan bir karede bitirirse, hemen tura yeniden ba\u015flamas\u0131na izin verilir.<\/p>

\u00a0<\/p>

A\u00e7\u0131k Tur:<\/b><\/p>

At her kareyi ziyaret eder ancak ba\u015flang\u0131\u00e7 noktas\u0131na tek bir hamlede ula\u015famayaca\u011f\u0131 bir karede sonlan\u0131rsa.<\/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

8 Queens Problemi: Dijkstra ve Yap\u0131sal Programlaman\u0131n Do\u011fu\u015fu<\/b><\/h2>

Max Bezzel taraf\u0131ndan 1848 y\u0131l\u0131nda ortaya at\u0131lan ve Carl Friedrich Gauss gibi d\u00e2hilerin dikkatini \u00e7eken bu problem, 1970\u201clerde modern bilgisayar biliminin babalar\u0131ndan Edsger W. Dijkstra taraf\u0131ndan bir \u201dprogramlama manifestosuna\" d\u00f6n\u00fc\u015ft\u00fcr\u00fclm\u00fc\u015ft\u00fcr.<\/p>

Dijkstra ve DFS Aras\u0131ndaki Ba\u011flant\u0131<\/b><\/h3>

Onun ufuk a\u00e7\u0131c\u0131 \u00e7al\u0131\u015fmas\u0131nda, <\/span>Yap\u0131land\u0131r\u0131lm\u0131\u015f Programlama \u00dczerine Notlar<\/span><\/i> (1972), Dijkstra, bir algoritman\u0131n \u201cad\u0131m ad\u0131m iyile\u015ftirme\u201d ad\u0131n\u0131 verdi\u011fi bir s\u00fcre\u00e7le sistematik olarak nas\u0131l olu\u015fturulabilece\u011fini g\u00f6stermek i\u00e7in 8 Queens Problemini kullanm\u0131\u015ft\u0131r.\u201d<\/span><\/p>

  • DFS ve Backtracking: Dijkstra, bir veziri s\u0131raya koyup bir sonrakine inme (Depth-First Search - DFS) ve bir \u00e7\u0131kmaza girildi\u011finde farkl\u0131 bir olas\u0131l\u0131\u011f\u0131 denemek i\u00e7in bir \u00f6nceki ad\u0131ma geri d\u00f6nme (Backtracking) y\u00f6ntemini yap\u0131sal programlaman\u0131n en saf \u00f6rne\u011fi olarak tan\u0131mlam\u0131\u015ft\u0131r.<\/li><\/ul>

    Geriye D\u00f6nmenin G\u00fcc\u00fc:<\/b><\/p>

    Dijkstra'ya g\u00f6re bu yakla\u015f\u0131m, \u201cdeneme-yan\u0131lma\u201d s\u00fcrecinin kusursuz bir mant\u0131ksal diziye d\u00f6n\u00fc\u015ft\u00fcr\u00fclmesinde ilk \u00f6nemli kilometre ta\u015f\u0131n\u0131 temsil etmektedir.<\/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

    Bu\u011fday ve Satran\u00e7 Tahtas\u0131 Problemi: \u00dcstel B\u00fcy\u00fcme<\/b><\/h3>

    Efsane ve K\u00f6ken:<\/b><\/p>

    Hikayeye g\u00f6re, satranc\u0131n mucidi Sissa bin Dahir, oyunu Hindistan Kral\u0131'na sundu\u011funda, Kral ona ne gibi bir \u00f6d\u00fcl istedi\u011fini sormu\u015f. Sissa g\u00f6r\u00fcn\u00fc\u015fte m\u00fctevaz\u0131 bir istekte bulunmu\u015f: \u201cSatran\u00e7 tahtas\u0131n\u0131n ilk karesi i\u00e7in bir, ikincisi i\u00e7in iki, \u00fc\u00e7\u00fcnc\u00fcs\u00fc i\u00e7in d\u00f6rt ve sonraki her kare i\u00e7in bir \u00f6ncekinin iki kat\u0131 bu\u011fday tanesi istiyorum.\u201d Kral ba\u015flang\u0131\u00e7ta bunun sadece \u201cbir avu\u00e7 bu\u011fday\u201d oldu\u011funu d\u00fc\u015f\u00fcnerek bu talebi reddetti; ancak hesaplama ba\u015flad\u0131\u011f\u0131nda, ne hazinenin ne de d\u00fcnyan\u0131n t\u00fcm bu\u011fday stoklar\u0131n\u0131n bu talebi kar\u015f\u0131lamaya yetmeyece\u011fi anla\u015f\u0131ld\u0131.<\/p>

    Tarihsel Kay\u0131t: \u0130bn Hallikan (1256)<\/b><\/p>

    Bu \u00fcnl\u00fc hikayenin bilinen ilk yaz\u0131l\u0131 kayd\u0131 1256 y\u0131l\u0131nda \u00fcnl\u00fc biyografi yazar\u0131 ve tarih\u00e7i \u0130bn Hallikan taraf\u0131ndan belgelenmi\u015ftir. \u0130bn Hallikan bu olay\u0131 sadece bir masal olarak de\u011fil, matemati\u011fin hayal g\u00fcc\u00fcn\u00fcn s\u0131n\u0131rlar\u0131n\u0131 nas\u0131l zorlad\u0131\u011f\u0131n\u0131n bir kan\u0131t\u0131 olarak eserine dahil etmi\u015ftir.<\/p>

    Matematiksel Ger\u00e7eklik:<\/b><\/p>

    Satran\u00e7 tahtas\u0131ndaki 64 kare i\u00e7in yap\u0131lan bu talep, geometrik ilerlemenin (\u00fcstel b\u00fcy\u00fcme) en saf \u00f6rne\u011fidir. Her bir karedeki miktar \u015fu form\u00fcl kullan\u0131larak hesaplan\u0131r 2n-1<\/sup><\/strong> . Toplam bu\u011fday miktar\u0131n\u0131 veren denklem a\u015fa\u011f\u0131daki gibidir:<\/span><\/p>

    \u00a0<\/p>

    S =<\/span>


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

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

    Bu hesaplama sonucunda ortaya \u00e7\u0131kan b\u00fcy\u00fck rakam \u015fudur:<\/p>

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

    Neden Bu Kadar \u00d6nemli?<\/b><\/p>

    • B\u00fcy\u00fcme \u00d6l\u00e7e\u011fi:<\/b> Bu say\u0131, d\u00fcnyan\u0131n mevcut toplam y\u0131ll\u0131k bu\u011fday \u00fcretiminin yakla\u015f\u0131k 2.000 kat\u0131na e\u015fde\u011ferdir.\u00a0<\/span><\/li><\/ul>

      Stratejik Ders:<\/b> Bu sorun, liderlere ve stratejistlere k\u00fc\u00e7\u00fck de\u011fi\u015fikliklerin (\u201cikiye katlama\u201d) zaman i\u00e7inde nas\u0131l kontrol edilemez g\u00fc\u00e7lere d\u00f6n\u00fc\u015febilece\u011fini \u00f6\u011freten eski bir bilgelik dersidir.<\/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\/tr\/wp-json\/wp\/v2\/pages\/963","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/comments?post=963"}],"version-history":[{"count":22,"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/pages\/963\/revisions"}],"predecessor-version":[{"id":1443,"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/pages\/963\/revisions\/1443"}],"up":[{"embeddable":true,"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/pages\/743"}],"wp:attachment":[{"href":"https:\/\/shatranj.art\/tr\/wp-json\/wp\/v2\/media?parent=963"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}