"Completeness of Unbounded Best-First Game Algorithms."

Quentin Cohen-Solal (2021)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2021-09-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics