{"id":10193,"date":"2022-04-13T23:48:04","date_gmt":"2022-04-13T20:48:04","guid":{"rendered":"https:\/\/kutaybilen.com.tr\/?p=10193"},"modified":"2022-04-13T23:48:04","modified_gmt":"2022-04-13T20:48:04","slug":"akilli-cay-bardagi-oyunu-aklinizdan-gecenleri-nasil-biliyor","status":"publish","type":"post","link":"https:\/\/kutaybilen.com.tr\/?p=10193","title":{"rendered":"Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 Oyunu Akl\u0131n\u0131zdan Ge\u00e7enleri Nas\u0131l Biliyor?"},"content":{"rendered":"<p>Bundan yakla\u015f\u0131k 10 y\u0131l evvel so\u011fuk \u00e7ay \u00fcreticisi Lipton, T\u00fcrkiye\u2019de \u00e7ok ses getiren bir kampanyaya imza att\u0131: <strong>Her \u015eeyi Bilen Bayan<\/strong>. Bir han\u0131mefendi, akl\u0131n\u0131zdan rastgele bir \u015fey tutman\u0131z\u0131 istiyor ve size birka\u00e7 soru soruyordu. Bu sorular git gide sizin akl\u0131n\u0131zda tuttu\u011funuz objeye nazaran \u015fekilleniyor, sonunda da \u00e7ok y\u00fcksek ihtimalle hakikat yan\u0131t\u0131 biliyordu.<\/p>\n<p>Daha sonras\u0131nda farkl\u0131 haller alan oyun, Lipton taraf\u0131ndan da b\u0131rak\u0131lmad\u0131 ve <strong>Lipton Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131<\/strong> oyununa d\u00f6n\u00fc\u015ft\u00fc. Bu uygulaman\u0131n mant\u0131\u011f\u0131 ise Her \u015eeyi Bilen Bayan ile birebir t\u0131pk\u0131. Lakin b\u00fct\u00fcn bunlar\u0131n bir atas\u0131 var: <strong>Akinat\u00f6r<\/strong>.<\/p>\n<p>K\u0131saca s\u00f6yleyecek olursak Akinat\u00f6r bir ki\u015fi ya da karakter \u00fczerine, Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 ise neredeye t\u00fcm genel ge\u00e7er kavramlar \u00fczerine <strong>ak\u0131l okumay\u0131<\/strong> sa\u011flayan bir programlamayla olu\u015fturulmu\u015f durumda. Asl\u0131nda temalar de\u011fi\u015fse de <em>hepsi benzeri \u00e7al\u0131\u015fma mant\u0131\u011f\u0131na sahip.<\/em><\/p>\n<p><b>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 nas\u0131l oynan\u0131r?<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/e32da3de36c1e0cc20ff6a34415e90c0defa869e.jpeg\"\/><\/p>\n<p>Asl\u0131nda oyunu oynamak hayli kolay, \u00e7\u00fcnk\u00fc bu \u00fcslup oyunlar\u0131n hepsinin mant\u0131\u011f\u0131 neredeyse b\u00fcsb\u00fct\u00fcn t\u0131pk\u0131. Kar\u015f\u0131n\u0131za \u00e7\u0131kan karakter -bu durumda bir \u00e7ay barda\u011f\u0131 ya da bir kad\u0131n- sizden akl\u0131n\u0131zdan bir \u015fey, bir obje tutman\u0131z\u0131 istiyor. Ancak <strong>herkesin bilebilece\u011fi \u00fcslupta<\/strong> bir \u201c\u015fey\u201d olmak zorunda. Ay\u015fe \u00fczere Mehmet \u00fczere bir \u00f6zel isim; ya da <em>Bayburt \u00fczere Berlin \u00fczere<\/em> kent ismi olmamal\u0131.<\/p>\n<p>Akabinde Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131, size toplam 20 adet soru soraca\u011f\u0131n\u0131 ve sonunda akl\u0131ndan tuttu\u011funuz \u015feyi <strong>bulaca\u011f\u0131n\u0131 <\/strong>s\u00f6yl\u00fcyor. Sorular kar\u015f\u0131n\u0131za geldik\u00e7e \u201cEvet, Hay\u0131r, Emin de\u011filim\u201d se\u00e7eneklerinden bir adedini se\u00e7iyorsunuz. Vakit ge\u00e7tik\u00e7e sorular sizin akl\u0131ndan tuttu\u011funuz objeye nazaran \u015fekillenmeye ba\u015fl\u0131yor. Sonunda da bir bakm\u0131\u015fs\u0131n\u0131z ak\u0131ll\u0131 bardak <strong>akl\u0131n\u0131zdan ge\u00e7eni bilmi\u015f<\/strong>. Nas\u0131l oldu\u011funu anlatmadan evvel, birka\u00e7 bilgi daha verelim.<\/p>\n<p><b>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 gibisi kestirim oyunlar\u0131:<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/3614c5aab298ffcbf7ce50597d3f7d9d35a02919.jpeg\"\/><\/p>\n<ul>\n<li>Akinat\u00f6r<\/li>\n<li>20q<\/li>\n<li>Guess The Dictator\/Sit-Com Character<\/li>\n<\/ul>\n<p><b>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 oynay\u0131nca akl\u0131m\u0131z nas\u0131l okunuyor?<\/b><\/p>\n<p>\u015eimdiden spoiler verelim, Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 ve gibisi oyunlar <strong>akl\u0131m\u0131z\u0131 falan okumuyor<\/strong>. B\u00fcsb\u00fct\u00fcn g\u00fczelce tasarlanm\u0131\u015f bir yaz\u0131l\u0131mdan ibaretler. Bunu da se\u00e7enekleri eleyerek yap\u0131yorlar. Akinat\u00f6r mant\u0131\u011f\u0131n\u0131 anlamam\u0131z i\u00e7in, yaz\u0131l\u0131m d\u00fcnyas\u0131nda s\u0131k\u00e7a rastlanan ve kullanan Binary search (ikili arama) ya da <strong>Binary Tree<\/strong> (\u0130kili A\u011fa\u00e7) kavramlar\u0131n\u0131 a\u00e7\u0131klamam\u0131z gerek.<\/p>\n<p><b>Pekala nedir bu akl\u0131m\u0131z\u0131n okunmas\u0131n\u0131 sa\u011flayan Binary Tree?<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/036d3d10b1be71227a344b18e81619eed0340cd0.png\"\/><\/p>\n<p>Her bir kesimin yaln\u0131zca iki adet \u201c\u00e7ocu\u011fu\u201d olan a\u011fa\u00e7 sistemlerine Binary Tree denir. Bu sistem ise yinelemeli (recursive) bi\u00e7imde devam eder. Bu durumda s\u0131f\u0131r\u0131nca katmanda 1, birinci katmanda 2, ikinci katmanda 4, \u00fc\u00e7\u00fcnc\u00fc katmanda 8; elhas\u0131l n\u2019inci katmanda <strong>2^n<\/strong> kadar d\u00fc\u011f\u00fcm (node) bulunur.<\/p>\n<p><b>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 oyunundaki mant\u0131k da b\u00fcsb\u00fct\u00fcn Binary Tree\u2019den ibaret.<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/800d469632c19af739dd41c13c62f882d4993437.jpeg\"\/><\/p>\n<p>Uygulama, size 20 soru sorarak (2^20 = 1.048.576) <strong>1 milyondan fazla<\/strong> farkl\u0131 yan\u0131t\u0131 birka\u00e7 se\u00e7ene\u011fe d\u00fc\u015f\u00fcrebiliyor. Ba\u015f\u0131n\u0131zda canland\u0131racak olursan\u0131z, birinci sorunun yan\u0131t\u0131yla birlikte t\u00fcm se\u00e7eneklerin yar\u0131s\u0131 eleniyor. Size birinci d\u00fc\u011f\u00fcm\u00fcn bir \u00e7ocu\u011funu, verdi\u011finiz kar\u015f\u0131l\u0131\u011fa nazaran silmi\u015f oluyorsunuz. B\u00f6ylelikle 1 milyon se\u00e7enek, yaln\u0131zca 20 soruyla \u00e7abucak elenmi\u015f oluyor.<\/p>\n<p>Yani asl\u0131nda burada as\u0131l s\u00fcre\u00e7, \u00e7ok fazla olan datalar\u0131 en k\u0131sa halde <strong>azaltmak<\/strong>. Her ne kadar yaz\u0131l\u0131m d\u00fcnyas\u0131nda farkl\u0131 s\u0131ralama ve eleme form\u00fclleri olsa da ikili sistem bunlar\u0131n en verimlilerinden.<\/p>\n<p><em>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131\u2019n\u0131n sordu\u011fu her soru<\/em>, kendi <strong>veritaban\u0131nda <\/strong>(database) haz\u0131r olarak bulunan sorulardan. Bununla birlikte misal halde Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131\u2019n\u0131n yaz\u0131l\u0131m\u0131, her bir soru i\u00e7in bir yanl\u0131\u015fs\u0131z oldu\u011fu kar\u015f\u0131l\u0131klar\u0131 (nesneler) da veritaban\u0131nda tutuyor. Yani N adet kestirimi obje ve M adet de soru varsa, Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 n\u0131n veritaban\u0131nda saklad\u0131\u011f\u0131 N*M kadar yan\u0131t var. Her \u015fey bu kadar kolay.<\/p>\n<p><b>Tamam da her \u015fey yar\u0131 yar\u0131ya azalarak gidiyorsa sorularda neden \u00fc\u00e7\u00fcnc\u00fc bir se\u00e7enek var?<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/8f9aceda20066e70806c1e7800d1e03271918e21.jpeg\"\/><\/p>\n<p>\u00dcstte eleme sistemi kullan\u0131ld\u0131\u011f\u0131n\u0131 ve her seferinde yan\u0131tlar\u0131n yar\u0131s\u0131n\u0131n gitti\u011finden bahsetmi\u015ftik. Lakin oyunu a\u00e7t\u0131\u011f\u0131n\u0131zda g\u00f6rebilece\u011finiz \u00fczere, bir tanesi <em>Emin De\u011filim<\/em> olmak \u00fczere <strong>\u00fc\u00e7 farkl\u0131 <\/strong>yan\u0131t talihiniz var. Yaln\u0131zca Evet\/Hay\u0131r yan\u0131tlar\u0131 olsayd\u0131 i\u015flevlerin d\u00f6nd\u00fcrd\u00fc\u011f\u00fc bedel (yani cevap) <strong>boolean<\/strong> (k\u0131saca 1 yahut 0) olacakt\u0131 ve s\u00fcre\u00e7 daha da kolayla\u015facakt\u0131. Pekala durum b\u00f6yleyken, yaz\u0131l\u0131m bunu nas\u0131l k\u0131ymetlendiriyor?<\/p>\n<p>Yaz\u0131l\u0131m\u0131n &#8220;boolean&#8221; yani evet ya da hay\u0131r d\u0131\u015f\u0131nda \u00fc\u00e7\u00fcnc\u00fc se\u00e7enek sunmas\u0131n\u0131n\u00a0<strong>birka\u00e7 avantaj\u0131<\/strong> var. \u00d6ncelikle her bir kar\u015f\u0131l\u0131\u011f\u0131n her bir obje i\u00e7in ger\u00e7ek olmas\u0131 gerekmiyor. <em>B\u00f6ylelikle daha yak\u0131n olanlar\u0131 da se\u00e7me imkan\u0131 do\u011fuyor<\/em>. \u0130kincisi, be\u015ferler birebir obje i\u00e7in uzla\u015famay\u0131p farkl\u0131 yan\u0131tlar\u0131 verebilirler. \u00dc\u00e7\u00fcnc\u00fc bir se\u00e7ene\u011fin olmas\u0131 ise program\u0131n yanl\u0131\u015fs\u0131z yan\u0131ta yakla\u015fmas\u0131nda esneklik sa\u011fl\u0131yor.<\/p>\n<p><b>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 tam olarak bir yapay zek\u00e2 de\u011fil, asl\u0131nda hi\u00e7 de\u011fil? Pekala o vakit ne?<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/2625d9ed62068f881f41bb95afdb958ebb986620.jpeg\"\/><\/p>\n<p>Ola\u011fan kaideler alt\u0131nda, bu t\u00fcrl\u00fc bir program c\u00fcmb\u00fc\u015f maksatl\u0131 yaz\u0131lmay\u0131p bilimsel ara\u015ft\u0131rmalarda kullan\u0131lsayd\u0131 i\u015fin i\u00e7erisine <strong>derin \u00f6\u011frenme ve yapay zeka<\/strong> da girecek, program kullan\u0131c\u0131lar\u0131n girdi\u011fi datalar\u0131 vakit i\u00e7erisinde daha g\u00fczel tahlil edip yanl\u0131\u015fs\u0131z sonu\u00e7lar\u0131 daha kesin olarak verecekti. Ama Lipton\u2019un yaln\u0131zca bir c\u00fcmb\u00fc\u015f gayesi g\u00fcderek olu\u015fturdu\u011fu Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131\u2019nda bu metodun kullan\u0131lmad\u0131\u011f\u0131na eminiz.<\/p>\n<p>Uygulaman\u0131n birtak\u0131m vakitlerde b\u00fcsb\u00fct\u00fcn alakas\u0131z kar\u015f\u0131l\u0131klar vermesinin temel sebebi de \u00f6\u011frenme s\u00fcrecinin ger\u00e7ekle\u015fmiyor olu\u015fu. Tekrar Binary Tree \u00f6rne\u011finden gidecek olursak, ba\u015fta verilen yanl\u0131\u015f bir karar binlerce se\u00e7ene\u011fi tek seferde eleyece\u011fi i\u00e7in akl\u0131ndan tuttu\u011funuz objenin \u00e7\u0131kmama m\u00fcmk\u00fcnl\u00fc\u011f\u00fc da <strong>az\u0131msanabilecek <\/strong>halde de\u011fil.<\/p>\n<p><b>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131 d\u0131\u015f\u0131ndaki ba\u015fka oyunlarda durum epey\u00a0farkl\u0131:<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/e4f320dc9996611eca9273d28f305db9ec410334.jpeg\"\/><\/p>\n<p>Ak\u0131ll\u0131 \u00c7ay Barda\u011f\u0131\u2019n\u0131n \u00f6b\u00fcr \u00f6rneklerine bakt\u0131\u011f\u0131m\u0131zda ise <strong>m<\/strong><strong>akine \u00f6\u011frenmesinin<\/strong> kullan\u0131ld\u0131\u011f\u0131n\u0131 g\u00f6r\u00fcyoruz. \u00dcstte ismini zikretti\u011fimiz <strong>20q.net<\/strong> sitesi, online oldu\u011fu \u00fczere daima <strong>yenilenen bir veritaban\u0131<\/strong> yap\u0131s\u0131na sahip.<\/p>\n<p>Emsal formda t\u00fcm bu oyunlar\u0131n atas\u0131 olan Akinat\u00f6r de do\u011fru\u00a0tahmin edece\u011fi insan say\u0131s\u0131n\u0131 t\u0131pk\u0131 mant\u0131k ile birlikte, daima art\u0131r\u0131p daha yanl\u0131\u015fs\u0131z hale getiriyor. Yani 10 y\u0131l evvel yaz\u0131ld\u0131\u011f\u0131 i\u00e7in yaln\u0131zca 10 y\u0131l \u00f6ncenin \u00fcnl\u00fclerini kar\u015f\u0131n\u0131za \u00e7\u0131karm\u0131yor; <strong>yeni \u00fcnl\u00fc isimleri de sisteme dahil ediyor.<\/strong><\/p>\n<p><b>Sonu\u00e7 olarak&#8230; Asl\u0131nda her \u015fey akla yatk\u0131n kullan\u0131lan yaz\u0131l\u0131mlardan ibaret ve sistem, d\u00fc\u015f\u00fcnd\u00fc\u011f\u00fcn\u00fczden daha kolay:<\/b><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.webtekno.com\/images\/editor\/default\/0002\/21\/23b68e8348d2d236d3801a486363d324e48ddc30.jpeg\"\/><\/p>\n<p>Bilgisayar M\u00fchendisli\u011fi bi\u00e7imi bir k\u0131s\u0131m okuduysan\u0131z ya da okumay\u0131 d\u00fc\u015f\u00fcn\u00fcyorsan\u0131z, birinci s\u0131n\u0131fta bahsedilen bahislerden birisinin s\u0131ralama yollar\u0131 ve verimlilikleri oldu\u011funu an\u0131msayacaks\u0131n\u0131z. En efektif tekniklerden birisi olan Binary Search Tree de rastgele bir bilgi k\u00fcmesinin taran\u0131p s\u0131ralamas\u0131ndan tutun, RAM\u2019lerin \u00e7al\u0131\u015fma yap\u0131s\u0131na kadar bir\u00e7ok alanda kullan\u0131l\u0131yor. Elbette bu \u00fcslup e\u011flenceli ve bir o kadar da hayranl\u0131k uyand\u0131r\u0131c\u0131 oyun ve uygulamalar\u0131 kolay bir formda olu\u015fturma i\u015fine de yar\u0131yor.\u00a0<\/p>\n<div> <\/div>\n","protected":false},"excerpt":{"rendered":"<p>Bundan yakla\u015f\u0131k 10 y\u0131l evvel so\u011fuk \u00e7ay \u00fcreticisi Lipton, T\u00fcrkiye\u2019de \u00e7ok ses getiren bir kampanyaya imza att\u0131: Her \u015eeyi Bilen Bayan. Bir &#8230;<\/p>\n","protected":false},"author":1,"featured_media":10194,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[15],"tags":[1437,2258,1027,1032,1237],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/posts\/10193"}],"collection":[{"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=10193"}],"version-history":[{"count":1,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/posts\/10193\/revisions"}],"predecessor-version":[{"id":10195,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/posts\/10193\/revisions\/10195"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=\/wp\/v2\/media\/10194"}],"wp:attachment":[{"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=10193"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=10193"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kutaybilen.com.tr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=10193"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}