Completeness of Unbounded Best-First Minimax and Descent Minimax
Completeness of Unbounded Best-First Minimax and Descent Minimax explores This paper theoretically analyzes and experimentally validates improvements to minimax search algorithms for two-player perfect information games, enhancing their ability to find winning strategies.. Commercial viability score: 3/10 in Game AI.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Builds On ThisOptimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPsViability: 2.0
- Prior WorkAsymmetric Nash Seeking via Best Response Maps: Global Linear Convergence and Robustness to Inexact Reaction ModelsViability: 3.0
- Prior WorkDecoupling Exploration and Policy Optimization: Uncertainty Guided Tree Search for Hard ExplorationViability: 3.0
- Prior WorkBest-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda ObjectivesViability: 3.0
- Higher Viability