"Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n."

Aviezri S. Fraenkel, David Lichtenstein (1981)

> Home

Details and statistics

DOI: 10.1016/0097-3165(81)90016-9

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/FraenkelL81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/FraenkelL81
Aviezri S. Fraenkel, David Lichtenstein:
Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. J. Comb. Theory A 31(2): 199-214 (1981)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.