메뉴 건너뛰기




Volumn , Issue , 2010, Pages 365-371

A UCT agent for Tron: Initial investigations

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE OF RANDOMNESS; MONTE CARLO; MONTE CARLO SIMULATION; TREE SEARCH;

EID: 80051950968     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2010.5593331     Document Type: Conference Paper
Times cited : (22)

References (23)
  • 1
    • 0001201757 scopus 로고
    • Some studies in machine learning using the game of checkers
    • A. Samuel, "Some studies in machine learning using the game of checkers," IBM Journal on Research and Development, vol. 11, no. 6, pp. 601-617, 1967.
    • (1967) IBM Journal on Research and Development , vol.11 , Issue.6 , pp. 601-617
    • Samuel, A.1
  • 2
    • 0000218399 scopus 로고
    • Programming a computer for playing chess
    • C. Shannon, "Programming a computer for playing chess," Philosophical Magazine, vol. 41, no. 4, pp. 256-275, 1950.
    • (1950) Philosophical Magazine , vol.41 , Issue.4 , pp. 256-275
    • Shannon, C.1
  • 4
    • 0029276036 scopus 로고
    • Temporal difference learning and TD-gammon
    • G. Tesauro, "Temporal difference learning and TD-gammon," Communications of the ACM, vol. 38, no. 3, pp. 58-68, 1995.
    • (1995) Communications of the ACM , vol.38 , Issue.3 , pp. 58-68
    • Tesauro, G.1
  • 6
  • 12
    • 0003582821 scopus 로고    scopus 로고
    • Games and information: An introduction to game theory
    • Blackwell
    • E. Rasmusen, Games and information: An introduction to game theory. Blackwell Pub, 2007.
    • (2007) Pub
    • Rasmusen, E.1
  • 13
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • DOI 10.1023/A:1013689704352, Computational Learning Theory
    • P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-time analysis of the multiarmed bandit problem," Machine Learning, vol. 47, no. 2, pp. 235-256, 2002. (Pubitemid 34126111)
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 15
    • 80051922214 scopus 로고    scopus 로고
    • Go, going, gone?
    • [Online]. Available
    • R. Blincoe, "Go, going, gone?" The Guardian, 2006. [Online]. Available: http://www.guardian.co.uk/technology/2009/apr/30/games-software-mogo/ print
    • (2006) The Guardian
    • Blincoe, R.1
  • 16
    • 70349287633 scopus 로고    scopus 로고
    • Computing elo ratings of move patterns in the game of go
    • Citeseer
    • R. Coulom, "Computing elo ratings of move patterns in the game of go," in Computer Games Workshop. Citeseer, 2007.
    • (2007) Computer Games Workshop
    • Coulom, R.1
  • 18
    • 77953733536 scopus 로고    scopus 로고
    • University of Alberta, Dept. of Computing Science, TR09-08, Tech. Rep April [Online]. Available
    • "Fuego-an open-source framework for board games and go engine based on monte-carlo tree search," University of Alberta, Dept. of Computing Science, TR09-08, Tech. Rep., April 2009. [Online]. Available: http://www.cs.ualberta.ca/TechReports/2009/TR09-08/TR09-08.pdf
    • (2009) Fuego-an Open-source Framework for Board Games and Go Engine Based on Monte-carlo Tree Search
  • 20
    • 70349273741 scopus 로고    scopus 로고
    • Experiments with Monte Carlo othello
    • DOI 10.1109/CEC.2007.4425000, 4425000, 2007 IEEE Congress on Evolutionary Computation, CEC 2007
    • P. Hingston and M. Masek, "Experiments with Monte Carlo Othello," in IEEE Congress on Evolutionary Computation, 2007. CEC 2007, 2007, pp. 4059-4064. (Pubitemid 351371926)
    • (2008) 2007 IEEE Congress on Evolutionary Computation, CEC 2007 , pp. 4059-4064
    • Hingston, P.1    Masek, M.2
  • 21
    • 70549113669 scopus 로고    scopus 로고
    • Monte-carlo tree search in poker using expected reward distributions
    • G. V. den Broeck, K. Driessens, and J. Ramon, "Monte-carlo tree search in poker using expected reward distributions," in ACML, 2009, pp. 367-381.
    • (2009) ACML , pp. 367-381
    • Den Broeck, G.V.1    Driessens, K.2    Ramon, J.3


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