Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N

  • Authors:
  • Aviezri S. Fraenkel;David Lichtenstein

  • Affiliations:
  • -;-

  • Venue:
  • Proceedings of the 8th Colloquium on Automata, Languages and Programming
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

Abstract