{"id":195,"date":"2024-03-26T07:49:10","date_gmt":"2024-03-26T07:49:10","guid":{"rendered":"https:\/\/shatranj.ai\/?page_id=195"},"modified":"2026-02-27T03:28:27","modified_gmt":"2026-02-27T03:28:27","slug":"mufredat-konulari","status":"publish","type":"page","link":"https:\/\/shatranj.ai\/tr\/mufredat-konulari\/","title":{"rendered":"M\u00fcfredat Konular\u0131"},"content":{"rendered":"
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

M\u00fcfredat Konular\u0131<\/h1>\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
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Shatranj.ai proje m\u00fcfredat\u0131 lms.shatranj.ai \u00fczerinden eri\u015filebilir. lms.shatranj.ai<\/a><\/strong><\/p>

A\u015fa\u011f\u0131da m\u00fcfredat konular\u0131n\u0131n k\u0131sa birer \u00f6zeti yer almaktad\u0131r<\/p>

Ders 1 - Kurs Kapsam\u0131 ve \u00d6ncelikleri<\/h1>
  • Shatranj.AI projesini, Erasmus+ vak\u0131flar\u0131n\u0131, ortak kurulu\u015flar\u0131 ve dijital platformlar\u0131 tan\u0131t\u0131yor.<\/li>
  • Proje vizyonu, Erasmus KA2 ba\u011flam\u0131<\/li>
  • Ortak kurumlar ve k\u00fclt\u00fcrel miras oda\u011f\u0131<\/li>
  • Platformlara genel bak\u0131\u015f (edit\u00f6r, LMS, kod ara\u00e7lar\u0131)<\/li>
  • \u00d6\u011fretmen rolleri ve \u00f6\u011frenci \u00e7\u0131kt\u0131lar\u0131<\/li>
  • M\u00fcfredat yap\u0131s\u0131na genel bak\u0131\u015f<\/li>
  • Python\/Jupyter tan\u0131t\u0131m\u0131<\/li><\/ul>

    Ders 2 - Bilgisayara Giri\u015f ve Python Kurulumu<\/h1>
    • \u00d6\u011frenciler temel bilgisayar kavramlar\u0131n\u0131 \u00f6\u011frenir ve Python\/Jupyter'\u0131 kurarlar.<\/li>
    • CPU, RAM, I\/O temelleri<\/li>
    • Bitler, baytlar, ikili g\u00f6sterim<\/li>
    • JupyterLab kurulumu<\/li>
    • \u0130lk Python not defteri y\u00fcr\u00fctmesi<\/li>
    • De\u011fi\u015fkenler, basit ifadeler<\/li>
    • Drive klas\u00f6rlerine eri\u015fim<\/li><\/ul>

      Ders 3 - Python Veri T\u00fcrleri<\/h1>
      • Python'un yerle\u015fik veri t\u00fcrlerini ve temel i\u015flemlerini kapsar.<\/li>
      • Tamsay\u0131lar, kayan say\u0131lar, dizeler, booleanlar<\/li>
      • Tip d\u00f6n\u00fc\u015f\u00fcm\u00fc<\/li>
      • Listeler ve indeksleme<\/li>
      • De\u011fi\u015febilirlik kavramlar\u0131<\/li>
      • Satran\u00e7 ta\u015flar\u0131-as-strings egzersizleri<\/li><\/ul>

        Ders 4 - Ko\u015fullular, D\u00f6ng\u00fcler, Kontrol Ak\u0131\u015f\u0131<\/h1>
        • Mant\u0131k, d\u00f6ng\u00fcler ve etkile\u015fimli programlar\u0131 tan\u0131t\u0131r.<\/li>
        • E\u011fer\/elif\/else mant\u0131\u011f\u0131<\/li>
        • Boole i\u015flemleri<\/li>
        • For\/while d\u00f6ng\u00fcleri<\/li>
        • Ara\/devam<\/li>
        • Basit giri\u015f programlar\u0131<\/li><\/ul>

          Ders 5 - Fonksiyonlar, Kapsam, Parametreler<\/h1>
          • Fonksiyonlar ile mod\u00fcler kod \u00f6\u011fretir.<\/li>
          • Fonksiyonlar\u0131 tan\u0131mlama<\/li>
          • Parametreler ve geri d\u00f6n\u00fc\u015fler<\/li>
          • Yerel\/k\u00fcresel kapsam<\/li>
          • Lambdalar<\/li>
          • K\u00fc\u00e7\u00fck fonksiyonel proje (par\u00e7a-de\u011fer hesaplay\u0131c\u0131)<\/li><\/ul>

            Ders 6 - Dosyalar, \u0130stisnalar, K\u00fct\u00fcphaneler, Testler<\/h1>
            • Dosyalar ve sa\u011flam kod ile \u00e7al\u0131\u015fma.<\/li>
            • Dosya okuma\/yazma<\/li>
            • Dene\/hari\u00e7 tut<\/li>
            • K\u00fct\u00fcphaneleri i\u00e7e aktarma<\/li>
            • Basit testler<\/li>
            • Ge\u00e7ersiz girdilerin i\u015flenmesi<\/li><\/ul>

              Ders 7 - OOP, S\u0131n\u0131flar, TicTacToe<\/h1>
              • OOP ile ilk kar\u015f\u0131la\u015fma.<\/li>
              • S\u0131n\u0131flar ve nesneler<\/li>
              • Nitelikler ve y\u00f6ntemler<\/li>
              • Oyun modelleme<\/li>
              • TicTacToe uygulamas\u0131<\/li>
              • OOP kodunda hata ay\u0131klama<\/li><\/ul>

                Ders 8 - Satran\u00e7 ve Shatranj Tahtas\u0131 Temsili<\/h1>
                • Satran\u00e7 ve Shatranj i\u00e7in y\u00f6netim kurulu temsilcilikleri<\/li>
                • Koordinat sistemleri ve indeksleme stratejileri<\/li>
                • Kart durumu i\u00e7in dahili veri yap\u0131lar\u0131<\/li>
                • UTF-8 ve par\u00e7alar\u0131n sembolik i\u015flenmesi<\/li>
                • Pano edit\u00f6rleri ve g\u00f6rselle\u015ftirme ara\u00e7lar\u0131 ile entegrasyon<\/li><\/ul>

                  Ders 9 - Par\u00e7a Hareketi, Oyun Durumu G\u00fcncellemeleri ve Terminal Ko\u015fullar\u0131<\/h1>
                  • Satran\u00e7 ve Shatranj'da ta\u015f hareket kurallar\u0131<\/li>
                  • Yasal ve s\u00f6zde yasal hamle \u00fcretimi<\/li>
                  • Bir hamleden sonra oyun durumunu g\u00fcncelleme<\/li>
                  • \u00c7ek ve yasad\u0131\u015f\u0131 otomatik kontrol\u00fcn tespit edilmesi<\/li>
                  • Terminal ko\u015fullar\u0131n\u0131n tespiti: \u015fah mat ve \u00e7\u0131kmaz<\/li><\/ul>

                    Ders 10 - Arama Problemleri ve \u00c7izge \u00c7aprazlama<\/h1>
                    • Arama problemi form\u00fclasyonu: durumlar, eylemler, ge\u00e7i\u015fler ve hedefler<\/li>
                    • Durum uzay\u0131 graflar\u0131 ve a\u011fa\u00e7lar\u0131<\/li>
                    • Derinlik \u00d6ncelikli Arama (DFS)<\/li>
                    • Geni\u015flik \u00d6ncelikli Arama (BFS)<\/li>
                    • Tekd\u00fczen Maliyet Aramas\u0131 (UCS)<\/li>
                    • Grafik izleme ve g\u00f6rselle\u015ftirme al\u0131\u015ft\u0131rmalar\u0131<\/li>
                    • Basit satran\u00e7 ve \u0131zgara tabanl\u0131 \u00f6rnekler<\/li><\/ul>

                      Ders 11 - Sezgisel Arama ve \u00c7eki\u015fmeli Oyun A\u011fa\u00e7lar\u0131<\/h1>
                      • Sezgisel fonksiyonlar ve bilin\u00e7li arama<\/li>
                      • Kabul edilebilirlik ve tutarl\u0131l\u0131k<\/li>
                      • A* arama<\/li>
                      • \u00c7eki\u015fmeli arama ve oyun a\u011fa\u00e7lar\u0131<\/li>
                      • Oyun durumlar\u0131 i\u00e7in de\u011ferlendirme fonksiyonlar\u0131<\/li>
                      • Minimaks arama<\/li>
                      • Stokastik ve belirsiz ortamlar i\u00e7in Expectiminimax<\/li>
                      • Alfa-beta budama ve performans geli\u015ftirmeleri<\/li>
                      • Oyun durumlar\u0131 i\u00e7in de\u011ferlendirme fonksiyonlar\u0131<\/li>
                      • Satran\u00e7 tabanl\u0131 \u00e7eki\u015fmeli \u00f6rnekler<\/li><\/ul>

                        Ders 12 - At Turu (\u015e\u00f6valye Turu)<\/h1>
                        • \u015e\u00f6valye Turu'nu \u00f6zyineleme ve sezgisel y\u00f6ntemlerle ara\u015ft\u0131r\u0131r.<\/li>
                        • \u015e\u00f6valye grafi\u011fi hareketi<\/li>
                        • A\u00e7\u0131k\/kapal\u0131 turlar<\/li>
                        • DFS ile geri izleme<\/li>
                        • Warnsdorff sezgiselli\u011fi<\/li>
                        • TSP ile Ba\u011flant\u0131<\/li><\/ul>

                          Ders 13 - Sekiz Krali\u00e7e Bulmacas\u0131<\/h1>
                          • Geri izleme ile k\u0131s\u0131tlama tatmini.<\/li>
                          • Krali\u00e7e sald\u0131r\u0131 mant\u0131\u011f\u0131<\/li>
                          • Yinelemeli arama<\/li>
                          • Optimizasyon teknikleri<\/li>
                          • Tarihsel krali\u00e7e referanslar\u0131<\/li>
                          • Notebook uygulamalar\u0131<\/li><\/ul>

                            Ders 14 - Bu\u011fday ve Satran\u00e7 Tahtas\u0131 Problemi<\/h1>
                            • Matematiksel bulmacalar ve \u00fcstel b\u00fcy\u00fcme.<\/li>
                            • Satran\u00e7 tahtas\u0131nda ikiye katlama<\/li>
                            • 2'nin kuvvetleri<\/li>
                            • M\u00fclakatlarda kullan\u0131lan Fuji Da\u011f\u0131 tipi hareketli zeka bulmacalar\u0131, uygulamal\u0131 matematik bulmacalar\u0131<\/li>
                            • Sihirli kareler<\/li>
                            • Smullyan mant\u0131k bulmacalar\u0131<\/li>
                            • \u015e\u00f6valye karo problemleri ve \u0131zgaradaki di\u011fer karo problemleri<\/li><\/ul>

                              Ders 15 - Minimax, Alfa-Beta, \u015eah Mat Mant\u0131\u011f\u0131<\/h1>
                              • Derin \u00e7eki\u015fmeli arama ve satran\u00e7 oyunlar\u0131.<\/li>
                              • Minimaks hesaplama<\/li>
                              • Alfa-beta budama<\/li>
                              • Muhalefet, \u00fc\u00e7genleme<\/li>
                              • Tarihsel kaynaklar (Al-Adli, Reti)<\/li><\/ul>

                                Ders 16 - Suli'nin Elmas\u0131 (Tarihi Oyun Sonu \u00c7al\u0131\u015fmas\u0131)<\/h1>
                                • Tarihi satran\u00e7 oyun sonu analizi, oyun sonu tablo tabanlar\u0131, dinamik programlama, hashing<\/li>
                                • Al-Suli biyografi<\/li>
                                • Oyun sonunun yeniden in\u015fas\u0131<\/li>
                                • Muhalefet ve \u00fc\u00e7genleme<\/li>
                                • Kar\u015f\u0131l\u0131k gelen kareler teorisi<\/li>
                                • C\/C++'da 1000 y\u0131ll\u0131k ikileme Dinamik Programlama kodu \u00e7\u00f6z\u00fcm\u00fc<\/li>
                                • \u00c7\u00f6z\u00fcm incelemesi play.shatranj.ai adresinde ve ayr\u0131ca not defterleri ascii panolar\u0131 arac\u0131l\u0131\u011f\u0131yla<\/li><\/ul>

                                  Ders 17 - Stockfish'i Shatranj Oynamak i\u00e7in \u00d6zelle\u015ftirme, Rybka-Deep Blue-Stockfish Hikayesi<\/h1>

                                  Modern satran\u00e7 motorlar\u0131n\u0131n nas\u0131l geli\u015fti\u011fini ve a\u00e7\u0131k kaynakl\u0131 motorlar\u0131n tarihsel varyantlara nas\u0131l uyarlanabilece\u011fini ara\u015ft\u0131r\u0131yor.<\/p>

                                  • Deep Blue'nun kaba kuvvet donan\u0131m aramas\u0131<\/li>
                                  • Rybka ve de\u011ferlendirme merkezli motorlar\u0131n y\u00fckseli\u015fi<\/li>
                                  • A\u00e7\u0131k, topluluk odakl\u0131 bir motor olarak Stockfish<\/li>
                                  • Stockfish ta\u015flar\u0131, hamleleri ve kurallar\u0131 nas\u0131l temsil eder?<\/li>
                                  • Par\u00e7a hareketinin de\u011fi\u015ftirilmesi (ferz, vezir), de\u011ferlendirme, yasall\u0131k kurallar\u0131<\/li>
                                  • Shatranj uyumlu arama ve de\u011ferlendirme olu\u015fturma<\/li><\/ul>

                                    Ders 18 - Peki\u015ftirmeli \u00d6\u011frenme Temelleri: Gridworld, Dinamik Programlama ve Karma\u015f\u0131kl\u0131k<\/h1>

                                    Kurallar tam olarak bilindi\u011finde k\u00fc\u00e7\u00fck bir \u0131zgara d\u00fcnyas\u0131n\u0131 \u00e7\u00f6zerek takviyeli \u00f6\u011frenmeyi (RL) tan\u0131t\u0131r, ard\u0131ndan bu \u201cher \u015feyi bilen\u201d yakla\u015f\u0131m\u0131n satran\u00e7 gibi b\u00fcy\u00fck oyunlar i\u00e7in neden k\u0131r\u0131ld\u0131\u011f\u0131n\u0131 g\u00f6sterir.<\/p>

                                    • Temsilci-\u00e7evre d\u00f6ng\u00fcs\u00fc; durumlar, eylemler, \u00f6d\u00fcller, b\u00f6l\u00fcmler; indirim fakt\u00f6r\u00fc \u03b3.<\/li>
                                    • Bellman yedeklerini kullanarak politika de\u011ferlendirme (\u201cs\u00fcr\u00fcklenen robot\u201d) ve de\u011fer yineleme (\u201chazine avc\u0131s\u0131\u201d).<\/li>
                                    • G\u00f6rsel de\u011fer yay\u0131l\u0131m\u0131 ve de\u011fer fonksiyonundan optimal bir politika t\u00fcretilmesi.<\/li>
                                    • Boyutsall\u0131\u011f\u0131n laneti: durum uzay\u0131 ve oyun a\u011fac\u0131 karma\u015f\u0131kl\u0131\u011f\u0131; Shannon say\u0131s\u0131 motivasyonu.<\/li>
                                    • Tarihsel \u201cdev oyunlar\u201d (\u00f6rne\u011fin, Timurlenk satranc\u0131, Go) \u00f6\u011frenmenin neden gerekli oldu\u011funa dair bir ba\u011flam olarak.<\/li><\/ul>

                                      Ders 19 - Donmu\u015f Kale: FrozenLake \u00fczerinde Tabularla Q-\u00d6\u011frenimi<\/h1>

                                      Planlamadan \u00f6\u011frenmeye ge\u00e7er: Temsilci haritas\u0131z ba\u015flar ve tablosal Q-\u00f6\u011frenme kullanarak deneme yan\u0131lma yoluyla bir politika \u00f6\u011frenir.<\/p>

                                      • FrozenLake\/Frozen Rook'u bir MDP olarak form\u00fcle edin: S, A, R, P, terminal durumlar, \u03b3.<\/li>
                                      • Q-\u00f6\u011frenme g\u00fcncelleme kural\u0131 ve \u03b5-greedy ke\u015fif (ke\u015fif\u2192s\u00f6m\u00fcr\u00fc program\u0131).<\/li>
                                      • Gymnasium FrozenLake'de bir arac\u0131 e\u011fitin; deterministik ve kaygan ge\u00e7i\u015fleri kar\u015f\u0131la\u015ft\u0131r\u0131n.<\/li>
                                      • Q-tablosu \u0131s\u0131 haritalar\u0131 \/ politika oklar\u0131 arac\u0131l\u0131\u011f\u0131yla \u00f6\u011frenilenleri inceleyin; \u03b1, \u03b3, \u03b5 ve b\u00f6l\u00fcm say\u0131lar\u0131n\u0131 ayarlay\u0131n.<\/li>
                                      • \u00d6l\u00e7eklendirme dersleri: seyrek \u00f6d\u00fcller, gecikmeli kredi ve daha b\u00fcy\u00fck haritalar\u0131n neden daha zor oldu\u011fu.<\/li><\/ul>

                                        Ders 20 - Yaln\u0131z \u015eah'a Kar\u015f\u0131 \u0130ki Kale \u015eah Mat: Uygulamada Zamansal Fark \u00d6\u011frenimi<\/h1>

                                        Q-\u00f6\u011frenmeyi k\u00fc\u00e7\u00fck bir satran\u00e7 oyun sonuna uygular ve deney defterini \u00f6\u011frenme ve e\u011fitim mod\u00fcllerinden ay\u0131rarak RL kod taban\u0131n\u0131 \u201cger\u00e7ek\u201d hale getirir.<\/p>

                                        • Temporal-Difference (TD) \u00f6\u011frenme: Q-\u00f6\u011frenme g\u00fcncellemesi i\u00e7indeki TD hatas\u0131n\u0131 tan\u0131mlama; oyun s\u0131ras\u0131nda neden TD g\u00fcncellemeleri.<\/li>
                                        • Monte Carlo \u00f6\u011frenimi satran\u00e7 benzeri, gecikmeli \u00f6d\u00fcll\u00fc oyunlar i\u00e7in neden \u00e7ok yava\u015ft\u0131r?.<\/li>
                                        • M\u00fchendislik y\u0131\u011f\u0131n\u0131: rl.py (Q-bellek + TD g\u00fcncellemesi), trainer.py (b\u00f6l\u00fcm d\u00f6ng\u00fcs\u00fc, ke\u015fif program\u0131), laboratuvar olarak not defteri.<\/li>
                                        • Satran\u00e7 pozisyonlar\u0131n\u0131 makine taraf\u0131ndan okunabilir durum (FEN) olarak kodlay\u0131n ve s\u0131n\u0131rl\u0131 bir oyun sonu\/bulmaca durum uzay\u0131 \u00fczerinde bir tablo arac\u0131s\u0131 e\u011fitin.<\/li>
                                        • S\u0131n\u0131rlar: tablo y\u00f6ntemlerinin tam satran\u00e7 i\u00e7in neden ba\u015far\u0131s\u0131z oldu\u011fu (boyutluluk laneti) ve fonksiyon yakla\u015f\u0131m\u0131 ihtiyac\u0131.<\/li><\/ul>

                                          Ders 21 - Derin Q-A\u011flar\u0131: Q-Tablolar\u0131ndan Sinir A\u011flar\u0131na<\/h1>

                                          Q-tablosunu bir sinir a\u011f\u0131 (DQN) ile de\u011fi\u015ftirerek ve bunu birka\u00e7 k\u00fc\u00e7\u00fck tahta oyununa uygulayarak RL i\u00e7in fonksiyon yakla\u015f\u0131m\u0131n\u0131 tan\u0131t\u0131r.<\/p>

                                          • Q-tablolar\u0131 neden \u00f6l\u00e7eklenmez: \u00e7ok fazla durum; genelleme, g\u00f6r\u00fclmeyen konumlar i\u00e7in de\u011ferleri \u201ctahmin edebilen\u201d bir model gerektirir.<\/li>
                                          • Derin Q-A\u011f (DQN) e\u011fitim d\u00f6ng\u00fcs\u00fc: yeniden oynatma tamponu, hedef a\u011f, mini toplu g\u00fcncellemeler, \u03b5-\u00e7\u00fcr\u00fcme.<\/li>
                                          • Connect-4 (4Connect), Fox & Hounds ve Othello\/Reversi gibi oyunlarda DQN'yi uygulay\u0131n ve deneyin.<\/li>
                                          • Te\u015fhis: \u00f6\u011frenme e\u011frileri, kararl\u0131l\u0131k sorunlar\u0131 (a\u015f\u0131r\u0131 tahmin, sapma) ve pratik hafifletmeler.<\/li>
                                          • Yakla\u015f\u0131mlar\u0131 kar\u015f\u0131la\u015ft\u0131r\u0131n: DQN vs NNUE tarz\u0131 de\u011ferlendirme ve el yap\u0131m\u0131 de\u011ferlendirme (HCE) mimari \u00f6d\u00fcnle\u015fimleri tart\u0131\u015fmak i\u00e7in.<\/li><\/ul>

                                            Ders 22 - Qirkat'ta Monte Carlo Rollouts ve MCTS<\/h1>

                                            Tam bir Qirkat ortam\u0131 olu\u015fturur ve ard\u0131ndan rastgele da\u011f\u0131t\u0131mlardan UCT se\u00e7imi ile tam Monte Carlo A\u011fa\u00e7 Aramas\u0131na (MCTS) kadar ilerler.<\/p>

                                            • Qirkat kurallar\u0131 omurgas\u0131n\u0131 (5\u00d75 tahta, C3 bo\u015f) ve yakalama dizilerini zorlayan maksimum yakalama kural\u0131n\u0131 uygulay\u0131n.<\/li>
                                            • Yakalama sat\u0131rlar\u0131n\u0131 numaraland\u0131ran, zorunlu yakalamay\u0131 zorlayan ve maksimum uzunluktaki yakalamalara filtre uygulayan hareket olu\u015fturma.<\/li>
                                            • Monte Carlo temelleri: rastgele da\u011f\u0131t\u0131mlar ve a\u011fac\u0131n yeniden kullan\u0131m\u0131n\u0131 eklemeden \u00f6nce d\u00fcz Monte Carlo hareket de\u011ferlendirmesi.<\/li>
                                            • MCTS boru hatt\u0131: se\u00e7im, geni\u015fletme, yay\u0131lma\/de\u011ferlendirme, geriye yay\u0131lma; UCT\/ziyaret say\u0131s\u0131 son hamle se\u00e7imi.<\/li>
                                            • Ad\u0131m ad\u0131m oynatma ve hata ay\u0131klama i\u00e7in yeniden \u00fcretilebilir oyun g\u00fcnl\u00fckleri ve denetim ara\u00e7lar\u0131.<\/li><\/ul>

                                              Ders 23 - AlphaZero Othello\/Reversi \u00fczerine<\/h1>

                                              Bir politika \u00f6nceli\u011fi ve bir de\u011fer tahmini sa\u011flayan bir sinir a\u011f\u0131 ekleyerek MCTS'yi AlphaZero tarz\u0131 aramaya y\u00fckseltir, ard\u0131ndan kendi kendine oyun yoluyla e\u011fitir.<\/p>

                                              • K\u00fc\u00e7\u00fck bir \u2018Connect2\u2019 AlphaZero demosu ile sezgiler aras\u0131nda k\u00f6pr\u00fc kurun, ard\u0131ndan fikirleri Othello'ya aktar\u0131n.<\/li>
                                              • UCT'yi PUCT ile de\u011fi\u015ftirin: rehber ke\u015fif \u00f6ncesinde ziyaret istatistiklerini \u00f6\u011frenilmi\u015f bir politika ile birle\u015ftirin.<\/li>
                                              • Sinir a\u011f\u0131 kafalar\u0131: politika (hamle olas\u0131l\u0131klar\u0131) ve de\u011fer (pozisyon de\u011ferlendirmesi) rastgele at\u0131\u015flar\u0131n yerine kullan\u0131l\u0131r.<\/li>
                                              • AlphaZero d\u00f6ng\u00fcs\u00fc: kendi kendine oyun \u2192 e\u011fitim hedefleri (\u03c0, z) \u2192 a\u011f g\u00fcncellemesi \u2192 tekrar; turnuva e\u015fle\u015fmeleri\/loglar\u0131 arac\u0131l\u0131\u011f\u0131yla de\u011ferlendirme.<\/li>
                                              • De\u011fi\u015fken uzunluktaki yakalama dizileri i\u00e7in yola duyarl\u0131 hareket kodlamas\u0131, b\u00f6ylece farkl\u0131 yakalama yollar\u0131 farkl\u0131 kal\u0131r.<\/li><\/ul>

                                                Ders 24 - AlphaZero Qirkat'ta: PUCT, Politika\/De\u011fer A\u011flar\u0131 ve Kendi Kendine Oyun<\/h1>

                                                Bir politika \u00f6nceli\u011fi ve bir de\u011fer tahmini sa\u011flayan bir sinir a\u011f\u0131 ekleyerek MCTS'yi AlphaZero tarz\u0131 aramaya y\u00fckseltir, ard\u0131ndan kendi kendine oyun yoluyla e\u011fitir.<\/p>

                                                • K\u00fc\u00e7\u00fck bir \u2018Connect2\u2019 AlphaZero demosu ile sezgiler aras\u0131nda k\u00f6pr\u00fc kurun, ard\u0131ndan fikirleri Qirkat'a aktar\u0131n.<\/li>
                                                • UCT'yi PUCT ile de\u011fi\u015ftirin: rehber ke\u015fif \u00f6ncesinde ziyaret istatistiklerini \u00f6\u011frenilmi\u015f bir politika ile birle\u015ftirin.<\/li>
                                                • Sinir a\u011f\u0131 kafalar\u0131: politika (hamle olas\u0131l\u0131klar\u0131) ve de\u011fer (pozisyon de\u011ferlendirmesi) rastgele at\u0131\u015flar\u0131n yerine kullan\u0131l\u0131r.<\/li>
                                                • AlphaZero d\u00f6ng\u00fcs\u00fc: kendi kendine oyun \u2192 e\u011fitim hedefleri (\u03c0, z) \u2192 a\u011f g\u00fcncellemesi \u2192 tekrar; turnuva e\u015fle\u015fmeleri\/loglar\u0131 arac\u0131l\u0131\u011f\u0131yla de\u011ferlendirme.<\/li>
                                                • De\u011fi\u015fken uzunluktaki yakalama dizileri i\u00e7in yola duyarl\u0131 hareket kodlamas\u0131, b\u00f6ylece farkl\u0131 yakalama yollar\u0131 farkl\u0131 kal\u0131r.<\/li><\/ul>

                                                  Ders 25 - T\u00fcrk Damas\u0131 (Dama):<\/h1>

                                                  Alfa-Beta, PUCT rehberli MCTS, Alfa S\u0131f\u0131r<\/h1>

                                                  T\u00fcrk Denetleyicilerini uygular ve yeniden kullan\u0131labilir bir e\u015fle\u015fme ko\u015fucusu ve toplu sim\u00fclasyon g\u00fcnl\u00fckleri kullanarak klasik aramay\u0131 (alfa-beta) MCTS ile kar\u015f\u0131la\u015ft\u0131r\u0131r.<\/p>

                                                  • Oyun motoru: tahta temsili, \u00e7oklu atlama yakalamalar\u0131yla yasal hamleler ve hamle yolu kodlamas\u0131.<\/li>
                                                  • De\u011ferlendirme fonksiyonu art\u0131 Negamax\/Alpha-Beta arama ajan\u0131; derinlik ve g\u00fc\u00e7 dengeleri.<\/li>
                                                  • T\u00fcrk Damas\u0131 i\u00e7in MCTS arac\u0131s\u0131 ve alfa-beta ile bire bir kar\u015f\u0131la\u015ft\u0131rmalar.<\/li>
                                                  • Tekrarlanabilir deneyler i\u00e7in evrensel ma\u00e7 ko\u015fucusu (play_game) ve toplu sim\u00fclasyon yard\u0131mc\u0131 programlar\u0131.<\/li>
                                                  • S\u0131n\u0131f incelemesi ve hata ay\u0131klama i\u00e7in d\u0131\u015fa aktar\u0131labilir g\u00fcnl\u00fckler (s\u0131k\u0131\u015ft\u0131r\u0131lm\u0131\u015f).<\/li><\/ul>\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\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"

                                                    Shatranj.ai project curriculum can be accessed through lms.shatranj.ai Below are the short summaries of topics within the curriculum. Lesson 1 \u2013 Course Scope and Priorities Introduces the Shatranj.AI project, its Erasmus+ foundations, partner organizations, and digital platforms. Project vision, Erasmus KA2 context Partner institutions and cultural heritage focus Overview of platforms (editor, LMS, code tools) […]<\/p>\n","protected":false},"author":11,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-195","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/pages\/195","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/users\/11"}],"replies":[{"embeddable":true,"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/comments?post=195"}],"version-history":[{"count":12,"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/pages\/195\/revisions"}],"predecessor-version":[{"id":820,"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/pages\/195\/revisions\/820"}],"wp:attachment":[{"href":"https:\/\/shatranj.ai\/tr\/wp-json\/wp\/v2\/media?parent=195"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}