{"created":"2020-09-01T15:36:40.073458+00:00","id":4986,"links":{},"metadata":{"_buckets":{"deposit":"77eac905-2981-4fa8-8b13-f4ab3d4982f6"},"_deposit":{"id":"4986","owners":[],"pid":{"revision_id":0,"type":"recid","value":"4986"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/4986","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Winning Strategies for Progressively Finite Games","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"Games are simple models of decisionmaking. Understanding games should help usunderstand decisions. Mathematical gamesprovide opportunities for building self-conceptand reducing the fear of failure and error.Progressively finite game is one of themathematical games. This paper proposes thesystem which analyses the nature of progressivelyfinite games such as the simple takeaway gameand nim game by means of generating winningstrategies. The system starts with the introductionof takeaway game, nim games and ends withproducing their winning strategies. A winningstrategy is a rule that tells the player which moveto make the player will eventually win.Progressively finite games of winning strategiesare based on the grundy value. Grundy values 0are in the winning strategy. The system uses theDigital Sum and Sprague-Grundy function ofCombinatorial Game Theory to find grundy value.Experimental results are show by means ofprobability theory as well as Bayes’ rule."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value":[]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-07-12"}],"displaytype":"preview","filename":"9_PDFsam_PSC_final proof.pdf","filesize":[{"value":"110 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/4986/files/9_PDFsam_PSC_final proof.pdf"},"version_id":"7a105d78-d926-4883-bcbf-5703695556bb"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Eighth Local Conference on Parallel and Soft Computing","subitem_pages":"","subitem_volume":""}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"","subitem_c_date":"","subitem_conference_title":"","subitem_part":"","subitem_place":"","subitem_session":"","subitem_website":""}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{"subitem_book_title":"","subitem_isbn":"","subitem_pages":"","subitem_place":"","subitem_publisher":""}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_awarding_university":"","subitem_supervisor(s)":[{"subitem_supervisor":""}]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Hlaing, Thiri"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2017"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/884"},"item_title":"Winning Strategies for Progressively Finite Games","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-07-12","publish_status":"0","recid":"4986","relation_version_is_last":true,"title":["Winning Strategies for Progressively Finite Games"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-03-24T23:14:01.899240+00:00"}