Changes in Representation which Preserve Strategies in Games
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.
@inproceedings{ijcai1971p66,
title = {Changes in Representation which Preserve Strategies in Games},
author = {Banerji, Ranan B. and Ernst, George W.},
booktitle = {Proceedings of the Second International Joint Conference on
Artificial Intelligence, {IJCAI-71}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {D.C. Cooper},
pages = {651---1},
year = {1971},
url = {https://ijcai.org/proceedings/1971/66},
}
TY - CPAPER TI - Changes in Representation which Preserve Strategies in Games AU - Banerji, Ranan B. AU - Ernst, George W. T2 - Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71 PB - International Joint Conferences on Artificial Intelligence PY - 1971 SP - 651 EP - -1 UR - https://ijcai.org/proceedings/1971/66 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
