Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-23T15:12:21.128Z Has data issue: false hasContentIssue false
  • English
  • Français

Disjunctive games with the last player losing

Published online by Cambridge University Press:  24 October 2008

P. M. Grundy  and
C. A. B. Smith
P. M. Grundy
Affiliation:
National Foundation for Educational ResearchLondon
C. A. B. Smith
Affiliation:
University CollegeLondon
Get access Rights & Permissions [Opens in a new window]

Extract

Various authors have discussed the ‘disjunctive compound’ of games with the last player winning (Grundy(2); Guy and Smith (3); Smith (4)). We attempt here to analyse the disjunctive compound with the last player losing, though unfortunately with less complete success. The problem was explored tentatively by the first named author, but the rigorous development is due to the second.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 52 , Issue 3 , July 1956 , pp. 527 - 533
Copyright
Copyright © Cambridge Philosophical Society 1956

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Bouton, C. L.Nim, a game with a complete mathematical theory. Ann. Math., Princeton, (2) 3 (1902), 35–9.CrossRefGoogle Scholar
(2)Grundy, P. M.Mathematics and games. Eureka, 2 (1939), 6–8.Google Scholar
(3)Guy, R. K. and Smith, C. A. B.The G-values of various games. Proc. Camb. phil. Soc. 52 (1956), 514–26.CrossRefGoogle Scholar
(4)Smith, C. A. B. Compound two-person deterministic games (unpublished).Google Scholar