A Generalized Heuristic for Can't Stop
نویسندگان
چکیده
Can’t Stop is a jeopardy stochastic game played on an octagonal game board with four six-sided dice. Optimal strategies have been computed for some simplified versions of Can’t Stop by employing retrograde analysis and value iteration combined with Newton’s method. These computations result in databases that map game positions to optimal moves. Solving the original game, however, is infeasible with current techniques and technology. This paper describes the creation of heuristic strategies for solitaire Can’t Stop by generalizing an existing heuristic and using genetic algorithms to optimize the generalized parameters. The resulting heuristics are easy to use and outperform the original heuristic by 19%. Results of the genetic algorithm are compared to the known optimal results for smaller versions of Can’t Stop, and data is presented showing the relative insensitivity of the particular genetic algorithm used to the balance between reduced noise and increased population diversity.
منابع مشابه
Heuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملCAn't Touch This: Practical and Generic Software-only Defenses Against Rowhammer Attacks
Rowhammer is a hardware bug that can be exploited to implement privilege escalation and remote code execution attacks. Previous proposals on rowhammer mitigation either require hardware changes or follow heuristic-based approaches (based on CPU performance counters). To date, there exists no instant protection against rowhammer attacks on legacy systems. In this paper, we present the design and...
متن کاملA Retrograde Approximation Algorithm for Multi-player Can't Stop
An n-player, finite, probabilistic game with perfect information can be presented as a 2n-partite graph. For Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. We have presented our success on tackling one-player Can’t Stop and two-player Can’t Stop. In this article we study the computational solution of multi-player Can...
متن کامل