ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2109.09468
  4. Cited By
Completeness of Unbounded Best-First Game Algorithms

Completeness of Unbounded Best-First Game Algorithms

11 September 2021
Quentin Cohen-Solal
ArXivPDFHTML

Papers citing "Completeness of Unbounded Best-First Game Algorithms"

3 / 3 papers shown
Title
On some improvements to Unbounded Minimax
On some improvements to Unbounded Minimax
Quentin Cohen-Solal
Tristan Cazenave
147
0
0
07 May 2025
Learning to Play Stochastic Two-player Perfect-Information Games without
  Knowledge
Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge
Quentin Cohen-Solal
Tristan Cazenave
26
0
0
08 Feb 2023
Minimax Strikes Back
Minimax Strikes Back
Quentin Cohen-Solal
Tristan Cazenave
32
13
0
19 Dec 2020
1