{"id":139,"date":"2019-10-14T12:12:50","date_gmt":"2019-10-14T12:12:50","guid":{"rendered":"http:\/\/webspace.ulbsibiu.ro\/daniel.volovici\/html\/?page_id=139"},"modified":"2020-05-16T20:25:33","modified_gmt":"2020-05-16T20:25:33","slug":"a-guessing-game","status":"publish","type":"page","link":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/?page_id=139","title":{"rendered":"A Guessing Game"},"content":{"rendered":"

\u00cen perioada 11 mai – 1 iunie 2020 se desf\u0103\u0219oar\u0103 concursul online\u00a0A Guessing Game.<\/em>
\nParticipan\u021bii vor crea un program care este bun la jocul \u201cA Guessing Game\u201d (Odd-and-Even or Matching Pennies).
\nDetalii despre \u00eenscriere, platforma de concurs, regulament g\u0103si\u021bi\u00a0aici<\/a>.<\/p>\n

All you know about luck for certain is that it\u2019s bound to change.\u201d <\/em>\u2013 Bret Harte, \u201cThe Outcasts of Poker Flat\u201d in The Luck of Roaring Camp and Other Stories<\/em><\/p>\n

https:\/\/www.targulcartii.ro\/bret-harte\/surghiunitii-din-poker-flat-pentru-literatura-universala-1965-301049<\/a><\/p>\n

Scopul jocului A Guessing Game<\/em> (Par-Impar<\/em> sau matching pennies<\/em>) este s\u0103 ghice\u0219ti ce va juca adversarul t\u0103u. S\u0103 acceptam c\u0103 noi (at\u00e2t fiecare dintre noi atunci c\u00e2nd vom juca pe server cu varianta propus\u0103, c\u00e2t \u0219i programul pe care \u00eel concepem tot noi) suntem jucatorul j1<\/sub>, iar adversarul nostru este jucatorul j2<\/sub> , cel impotriva c\u0103ruia juc\u0103m.<\/p>\n

Merg\u00e2nd pe varianta de joc de la matching pennies<\/em>, fiecare juc\u0103tor alege una dintre fe\u021bele unei monede: H=Head sau T=Tail. Dac\u0103 cei doi juc\u0103tori au ales aceea\u0219i fa\u021b\u0103, atunci juc\u0103torul 1 ca\u0219tig\u0103 runda respectiv\u0103. \u00cen caz contrar, dac\u0103 fe\u021bele sunt diferite, el pierde \u0219i c\u00ee\u0219tig\u0103 al doilea juc\u0103tor. Definim o variabil\u0103 binar\u0103 w(win) care ia valoarea 1 dac\u0103 j1 <\/sub>a c\u00e2\u0219tigat \u0219i ia valoarea 0 dac\u0103 j2<\/sub> este cel care a c\u00e2\u0219tigat.<\/p>\n

Dup\u0103 prima rund\u0103 urmeaz\u0103 o alta \u0219i tot a\u0219a p\u00e2n\u0103 se termin\u0103 jocul (adic\u0103 dup\u0103 N runde unde N se stabile\u0219te de la \u00eenceput). Dup\u0103 prima rund\u0103, \u00een func\u021bie de ce s-a intamplat, sau dupa un plan stabilit anterior alegem din nou dac\u0103 s\u0103 juc\u0103m H sau T. Mai exact, \u00een sensul descris de Edgar Allan Poe \u00een nuvela<\/a> sa Scrisoarea furat\u0103<\/a> (The Purloined Letter<\/a>)<\/em> unde b\u0103ie\u021belul care c\u00e2\u0219tiga mereu la jocul Cu so\u021b ori f\u0103r\u0103 <\/em>analiza dac\u0103 adversarul va alege s\u0103 schimbe sau s\u0103 joace la fel ca data precedent\u0103, alegem dac\u0103 juc\u0103m la fel (variabila binar\u0103 c=change ia valoarea 0) sau daca schimb\u0103m op\u021biunea anterioar\u0103 (c va lua valoarea 1).<\/p>\n

\u00cencet, \u00eencet, sau \u201epas cu pas\u201d se construie\u0219te un istoric al jocului. S\u0103 presupunem c\u0103 am ajuns la runda t \u0219i urmeaz\u0103 s\u0103 alegem ce juc\u0103m.<\/p>\n

\"\"<\/p>\n

ai <\/sub>este alegerea juc\u0103torului j1<\/sub> (adica noi) \u00een runda i, ai<\/sub>\u2208{H,T}.<\/p>\n

bi<\/sub>\u2208{H,T} este alegerea juc\u0103torului j2 <\/sub>(adversarul nostru) in runda i.<\/p>\n

\"\"<\/p>\n

Variabila de schimbare c este definit\u0103 doar pentru ceea ce juc\u0103m noi \u0219i \u00een consecin\u021b\u0103:<\/p>\n

\"\"<\/p>\n

De exemplu, s\u0103 presupunem c\u0103 un joc a evoluat conform tabelului urm\u0103tor \u0219i am ajuns la runda 15:<\/p>\n

\"\"<\/a><\/p>\n

Scorul reprezint\u0103 c\u00e2\u0219tigul total, adic\u0103 diferen\u021ba dintre num\u0103rul total de victorii de rund\u0103 \u0219i num\u0103rul total de \u00eenfr\u00e2ngeri; \u00een exemplul acesta este -1 <\/strong>(minus 1).<\/p>\n

Se observ\u0103 c\u0103 la orice moment de timp (adic\u0103 la orice rund\u0103) imediat ce am stabilit c\u0103 schimb\u0103m sau nu, alegerea este deja f\u0103cut\u0103, c\u0103ci adversarul alege sincron cu noi \u0219i deci \u0219i victoria w este determinat\u0103. Totu\u0219i, decizia noastr\u0103 o lu\u0103m pentru runda urm\u0103toare, dup\u0103 ce am aflat rezultatul rundei precedente (evident c\u0103 pot exista juc\u0103tori care s\u0103 joace dup\u0103 un plan anterior stabilit care s\u0103 nu depind\u0103 de alegerile adversarului \u0219i nici de rezultatul rundelor anterioare, dar nu consider c\u0103 e neaparat o atitudine ra\u021bional\u0103 \u0219i \u00een consecin\u021b\u0103 nu \u00eemi propun s\u0103 realizez un program care s\u0103 ac\u021bioneze astfel).<\/p>\n

De aceea subliniez c\u0103 decizia asupra schimb\u0103rii, adic\u0103 alegerea valorii lui ci<\/sub>, este ulterioar\u0103 afl\u0103rii rezultatului rundei precedente \u0219i de aceea prefer s\u0103 vizualizez tabelul anterior sub forma:<\/p>\n

\"\"<\/a><\/p>\n

\u00cen concluzie, istoria jocului va fi format\u0103 dintr-un \u0219ir binar
\n{a0<\/sub>,b0<\/sub>,a1<\/sub>,b1<\/sub>,…,ai<\/sub>,bi<\/sub>,…,at-1<\/sub>,bt-1<\/sub>},\u00a0sau din \u0219irul binar echivalent
\n{w0<\/sub>,c1<\/sub>,w1<\/sub>,…,ci<\/sub>,wi<\/sub>,…,ct-1<\/sub>,wt-1<\/sub>},\u00a0dar care trebuie s\u0103 fie ini\u021bializat cu condi\u021bia ini\u021biala a0<\/sub>. Prefer aceast\u0103 variant\u0103 \u0219i ea corespunde unui \u0219ir binar format din simboluri xi<\/sub>\u2208{1,0},\u00a0a\u0219adar din alfabetul binar \u2211={1,0}. Varianta anterioar\u0103 a istoriei era tot un \u0219ir binar, dar din alfabetul \u2211={H,T},\u00a0dar nu eviden\u021bia decizia de schimbare. Pentru c\u0103 suntem aici, am putea memora istoria ca \u0219ir al perechilor (ai<\/sub>, bi<\/sub>),\u00a0 iar \u0219irul ar fi cu elemente apar\u021bin\u00e2nd unul alfabet cu 4 simboluri.<\/p>\n

Pentru a putea avea date experimentale pe care s\u0103 antren\u0103m modelele, v\u0103 sugerez s\u0103 v\u0103 conecta\u021bi la adresa urm\u0103toare, s\u0103 v\u0103 face\u021bi un cont folosind o adres\u0103 valid\u0103 de email \u0219i s\u0103 alege\u021bi s\u0103 juca\u021bi o partid\u0103 de 200 de runde. S\u0103 juca\u021bi c\u00e2t mai serios, adic\u0103 s\u0103 \u00eencerca\u021bi s\u0103 ghici\u021bi ce va juca adversarul program \u0219i s\u0103 c\u00e2\u0219tiga\u021bi.<\/p>\n

http:\/\/193.226.29.27\/GuessingGame<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

\u00cen perioada 11 mai – 1 iunie 2020 se desf\u0103\u0219oar\u0103 concursul online\u00a0A Guessing Game. Participan\u021bii vor crea un program care este bun la jocul \u201cA Guessing Game\u201d (Odd-and-Even or Matching Pennies). Detalii despre \u00eenscriere, platforma de concurs, regulament g\u0103si\u021bi\u00a0aici. All … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=\/wp\/v2\/pages\/139"}],"collection":[{"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=139"}],"version-history":[{"count":117,"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=\/wp\/v2\/pages\/139\/revisions"}],"predecessor-version":[{"id":529,"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=\/wp\/v2\/pages\/139\/revisions\/529"}],"wp:attachment":[{"href":"https:\/\/web.ulbsibiu.ro\/daniel.volovici\/html\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=139"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}