---
title: "Changes in Representation which Preserve Strategies in Games"
authors:
  - "Ranan B. Banerji"
  - "George W. Ernst"
doi: ""
url: "https://ijcai.org/proceedings/1971/66"
pdf: "https://ijcai.org/proceedings/1971/0066.pdf"
venue: "Proceedings of the Second International Joint Conference on Artificial Intelligence"
year: 1971
pages: "651--1"
track: ""
keywords:
---

# Changes in Representation which Preserve Strategies in Games

Ranan B. Banerji, George W. Ernst

*Proceedings of the Second International Joint Conference on Artificial Intelligence*, pages 651--1.

## 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.