![]() (While a Monte Carlo search, Maven does not use Monte Carlo tree search because it evaluates game trees only 2-ply deep, rather than playing out to the end of the game, and does not reallocate rollouts to more promising branches for deeper exploration in reinforcement learning terminology, the Maven search strategy might be considered "truncated Monte Carlo simulation". By simulating thousands of random drawings, the program can give a very accurate quantitative evaluation of the different plays. The most promising moves are then evaluated by "simming", in which the program simulates the random drawing of tiles, plays forward a set number of plays, and compares the points spread of the moves' outcomes. The program uses a rapid algorithm to find all possible plays from the given rack, and then part of the program called the "kibitzer" uses simple heuristics to sort them into rough order of quality. The "mid-game" phase lasts from the beginning of the game up until there are nine or fewer tiles left in the bag. Maven's gameplay is sub-divided into three phases: The "mid-game" phase, the "pre-endgame" phase, and the "endgame" phase. It has been used in official licensed Hasbro Scrabble games. Maven is an artificial intelligence Scrabble player, created by Brian Sheppard. ![]() ( Learn how and when to remove this template message) ( January 2010) ( Learn how and when to remove this template message) Statements consisting only of original research should be removed. ![]() Please improve it by verifying the claims made and adding inline citations. This article possibly contains original research.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |