• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International conference on intelligent games and simulation >Monte Carlo Tree Search for Love Letter
【24h】

Monte Carlo Tree Search for Love Letter

机译：蒙特卡罗树搜索情书

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Love Letter is a card game for two to four players. Players maintain one card in their hands at all times. For a series of rounds, a player draws a card and then plays one of the two cards in their hand with a goal of knocking out other players from the game by a card effect or by having the highest card at the end of the deck when all the cards have been played. We examined the use of Single Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) in a player agent for a two-player Love Letter, compared against a knowledge based agent, Perfect Information Monte Carlo (PIMC) and Deter-minized Minimax and found that none of the algorithm could show the stable results due to game randomness.
机译：情书是一款可供2至4名玩家玩的纸牌游戏。玩家始终保持手中一张卡。在一系列回合中，玩家抓一张牌，然后在手中玩两张牌中的一张，目的是通过牌效应或在牌组末尾拥有最高牌时将其他牌手从游戏中淘汰。所有的牌都被打过了。我们研究了单人观察员信息集蒙特卡洛树搜索（SO-ISMCTS）在两人情书的球员代理中的使用情况，并与基于知识的代理人Perfect Information Monte Carlo（PIMC）和确定最小化Minimax和发现由于游戏的随机性，该算法都无法显示稳定的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号