메뉴 건너뛰기




Volumn , Issue , 2008, Pages 67-70

To create adaptive game opponent by using UCT

Author keywords

Adaptive game AI; Dead end; UCT

Indexed keywords

ADAPTIVE GAME AI; BASIC PRINCIPLES; CHALLENGE LEVELS; COMPUTER GO; CONTROL APPROACH; DEAD END; MONTE CARLO; NON-PLAYER CHARACTER; UCT; UPPER CONFIDENCE BOUND; VIDEO GAME;

EID: 70449601986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIMCA.2008.81     Document Type: Conference Paper
Times cited : (7)

References (9)
  • 3
    • 77950557018 scopus 로고    scopus 로고
    • Peter Bentley Article, Feb
    • Peter Bentley Article, LETTING STONES GO UNTURNED, Feb, 2008.
    • (2008) Letting Stones go Unturned
  • 4
    • 38849138655 scopus 로고    scopus 로고
    • Lucas computational intelligence and games: Challenges and opportunities
    • January
    • Simon M. Lucas, Computational Intelligence and Games: Challenges and Opportunities, International Journal of Automation and Computing, Pages 45-57, January, 2008.
    • (2008) International Journal of Automation and Computing , pp. 45-57
    • Simon, M.1
  • 6
    • 84876770486 scopus 로고    scopus 로고
    • Wikipedia, Retrieved from, 22/08/08
    • Multi-armed bandit, Wikipedia, Retrieved from http://en.wikipedia.org/ wiki/Multi-armed-bandit (22/08/08).
    • Multi-armed Bandit
  • 7
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multi-armed bandit problem
    • Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multi-armed bandit problem. Machine Learning, 47(2/3):235-256, 2002.
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3


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