{"type":"ScholarlyArticle","title":"Changes in Representation which Preserve Strategies in Games","authors":[{"name":"Ranan B. Banerji","slug":"ranan-b-banerji","given":"Ranan B.","family":"Banerji","affiliation":""},{"name":"George W. Ernst","slug":"george-w-ernst","given":"George W.","family":"Ernst","affiliation":""}],"abstract":"One reason for changing the representation of a game is to make it similar to a previously solved one. As a definition of similarity, people have previously often proposed homomorphism-like structures, One such structure, the \"s0 -homomorphism\", is defined and studied in this paper. It is indicated t hat a useful winning strategy exists for any game in a general class called, \"positional games\", A set of sufficient condition s is derived which a game has to fulfill to have an s 0 -homomorphism with a positional game, The conditions are exemplified by applying it to a class of games shown by Newell to be representable as tic-tac-toe.","doi":null,"url":"https://ijcai.org/proceedings/1971/66","pdf":"https://ijcai.org/proceedings/1971/0066.pdf","markdown":"https://ijcai.org/proceedings/1971/66.md","bibtex":"https://ijcai.org/proceedings/1971/bibtex/66","volume":{"slug":"1971","title":"Proceedings of the Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1971","url":"https://ijcai.org/proceedings/1971/","year":1971,"location":"London, UK","dates":"","editors":"D.C. Cooper","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":66,"pages":{"first":651,"last":-1},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}