메뉴 건너뛰기




Volumn , Issue , 2011, Pages 87-94

Determinization and information set Monte Carlo Tree Search for the card game Dou Di Zhu

Author keywords

[No Author keywords available]

Indexed keywords

AI TECHNIQUES; CARD GAMES; DETERMINIZATION; GAME TREES; HIDDEN INFORMATION; IMPERFECT INFORMATION; INFORMATION SET; MAKING DECISION; MONTE CARLO; STOCHASTICITY; TREE SEARCH;

EID: 80054030477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2011.6031993     Document Type: Conference Paper
Times cited : (54)

References (23)
  • 1
    • 0036374294 scopus 로고    scopus 로고
    • GIB: Imperfect information in a computationally challenging game
    • M.L. Ginsberg, "GIB: Imperfect information in a computationally challenging game," Journal of Artificial Intelligence Research, vol. 14, 2001, pp. 303-358.
    • (2001) Journal of Artificial Intelligence Research , vol.14 , pp. 303-358
    • Ginsberg, M.L.1
  • 2
    • 77958561606 scopus 로고    scopus 로고
    • Lower bounding Klondike solitaire with Monte-Carlo planning
    • R. Bjarnason, A. Fern, and P. Tadepalli, "Lower bounding Klondike solitaire with Monte-Carlo planning," Proc. ICAPS-2009, 2009, p. 26-33.
    • (2009) Proc. ICAPS-2009 , pp. 26-33
    • Bjarnason, R.1    Fern, A.2    Tadepalli, P.3
  • 3
    • 58349118462 scopus 로고    scopus 로고
    • FF-Replan: A baseline for probabilistic planning
    • S. Yoon, A. Fern, and R. Givan, "FF-Replan: A Baseline for Probabilistic Planning," Proc. ICAPS-2007, 2007, p. 352-359.
    • (2007) Proc. ICAPS-2007 , pp. 352-359
    • Yoon, S.1    Fern, A.2    Givan, R.3
  • 4
    • 0032045637 scopus 로고    scopus 로고
    • Search in games with incomplete information: A case study using Bridge card play
    • PII S0004370297000829
    • I. Frank and D. Basin, "Search in games with incomplete information: a case study using Bridge card play," Artificial Intelligence, 1998, pp. 87-123. (Pubitemid 128403238)
    • (1998) Artificial Intelligence , vol.100 , Issue.1-2 , pp. 87-123
    • Frank, I.1    Basin, D.2
  • 5
    • 77958521798 scopus 로고    scopus 로고
    • Understanding the success of perfect information monte carlo sampling in game tree search
    • J. Long, N. Sturtevant, and M. Buro, "Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search," Proc. AAAI-10, 2010, pp. 134-140.
    • (2010) Proc. AAAI-10 , pp. 134-140
    • Long, J.1    Sturtevant, N.2    Buro, M.3
  • 7
    • 38049037928 scopus 로고    scopus 로고
    • Efficient selectivity and backup operators in Monte-Carlo tree search
    • Springer-Verlag
    • R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," Proc. 5th International Conference on Computers and Games, Springer-Verlag, 2006, p. 72-83.
    • (2006) Proc. 5th International Conference on Computers and Games , pp. 72-83
    • Coulom, R.1
  • 12
    • 80054036092 scopus 로고    scopus 로고
    • Monte Carlo tree search in Kriegspiel
    • Jul.
    • P. Ciancarini and G.P. Favini, "Monte Carlo tree search in Kriegspiel," Artificial Intelligence, vol. 174, Jul. 2010, pp. 670-684.
    • (2010) Artificial Intelligence , vol.174 , pp. 670-684
    • Ciancarini, P.1    Favini, G.P.2
  • 14
    • 80054017373 scopus 로고    scopus 로고
    • accessed 28th March 2011
    • J. McLeod, "Dou Dizhu," 2010. http://www.pagat.com/climbing/ doudizhu.html, accessed 28th March 2011.
    • (2010)
    • McLeod, J.1
  • 15
    • 80054013825 scopus 로고    scopus 로고
    • accessed28th March 2011
    • Wikipedia, "Dou Di Zhu," 2011. http://en.wikipedia.org/wiki/ Dou-Di-Zhu,accessed28th March 2011.
    • (2011) Dou di Zhu
  • 16
    • 84863947445 scopus 로고    scopus 로고
    • Determinization in Monte-Carlo Tree Search for the card game Dou di Zhu
    • E. Powley, D. Whitehouse, and P. Cowling, "Determinization in Monte-Carlo Tree Search for the card game Dou Di Zhu," Proc. AISB 2011, 2011.
    • (2011) Proc. AISB 2011
    • Powley, E.1    Whitehouse, D.2    Cowling, P.3
  • 17
    • 70349285005 scopus 로고    scopus 로고
    • Transpositions and move groups in Monte Carlo tree search
    • B.E. Childs, J.H. Brodeur, and L. Kocsis, "Transpositions and move groups in Monte Carlo tree search," Proc. CIG-08, 2008, p. 389-395.
    • (2008) Proc. CIG-08 , pp. 389-395
    • Childs, B.E.1    Brodeur, J.H.2    Kocsis, L.3
  • 18
    • 55249112709 scopus 로고    scopus 로고
    • On the parallelization of UCT
    • T. Cazenave and N. Jouandeau, "On the parallelization of UCT," Proc. CGW07, 2007, p. 93-101.
    • (2007) Proc. CGW07 , pp. 93-101
    • Cazenave, T.1    Jouandeau, N.2
  • 20
    • 57749083242 scopus 로고    scopus 로고
    • Bayes-relational learning of opponent models from incomplete information in no-limit poker
    • M. Ponsen, J. Ramon, T. Croonenborghs, K. Driessens, and K. Tuyls, "Bayes-Relational Learning of Opponent Models from Incomplete Information in No-Limit Poker," Proc. AAAI-08, 2008, pp. 1485-1487.
    • (2008) Proc. AAAI-08 , pp. 1485-1487
    • Ponsen, M.1    Ramon, J.2    Croonenborghs, T.3    Driessens, K.4    Tuyls, K.5
  • 22
    • 70549084537 scopus 로고    scopus 로고
    • Opponent modeling in Scrabble
    • M. Richards and E. Amir, "Opponent modeling in Scrabble," Proc. IJCAI 2007, 2007, p. 1482-1487.
    • (2007) Proc. IJCAI 2007 , pp. 1482-1487
    • Richards, M.1    Amir, E.2
  • 23
    • 77958533985 scopus 로고    scopus 로고
    • Improving state evaluation, inference, and search in trickbased card games
    • M. Buro, J.R. Long, T. Furtak, and N. Sturtevant, "Improving state evaluation, inference, and search in trickbased card games," Proc. IJCAI 2009, 2009, pp. 1407-1413.
    • (2009) Proc. IJCAI 2009 , pp. 1407-1413
    • Buro, M.1    Long, J.R.2    Furtak, T.3    Sturtevant, N.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.