Search Results for author:
Found 8 papers, 3 papers with code
Proof Number Based Monte-Carlo Tree Search
Furthermore, we extend this new algorithm to properly address games with draws, like Awari, by adding an additional layer of PNS on top of the MCTS tree.
Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics
We consider such a setting with a black-box job-shop system and an unknown scheduling heuristic that, for a given permutation of jobs, schedules the jobs for the black-box job-shop with the goal of minimizing the makespan.
Combining Monte-Carlo Tree Search with Proof-Number Search
Proof-Number Search (PNS) and Monte-Carlo Tree Search (MCTS) have been successfully applied for decision making in a range of games.
Split Moves for Monte-Carlo Tree Search
These decisions can be viewed as separate moves, which is already a common practice in multi-action games for efficiency reasons.
Service Selection using Predictive Models and Monte-Carlo Tree Search
A predictive model is developed using the National Home and Hospice Care Survey (NHHCS) dataset to quantify the effect of care services on the risk of re-hospitalization.
Foundations of Digital Archæoludology
Digital Archaeoludology (DAL) is a new field of study involving the analysis and reconstruction of ancient games from incomplete descriptions and archaeological evidence using modern computational techniques.
Ludii -- The Ludemic General Game System
While current General Game Playing (GGP) systems facilitate useful research in Artificial Intelligence (AI) for game-playing, they are often somewhat specialised and computationally inefficient.
Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups
In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough.
