메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 1441-1448

Learning to play like a human: Case injected genetic algorithms for strategic computer gaming

Author keywords

[No Author keywords available]

Indexed keywords

ASSET ALLOCATION; COMPUTER GAMING; GENETIC ALGORITHM PLAYER (GAP);

EID: 4344701874     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (23)
  • 3
    • 0031219995 scopus 로고    scopus 로고
    • An air mission planning algorithm using decision analysis and mixed integer programming
    • Sep-Oct
    • B. J. Griggs, G. S. Parnell, and L. J. Lemkuhl. An air mission planning algorithm using decision analysis and mixed integer programming. Operations Research, 45(5):662-676, Sep-Oct 1997.
    • (1997) Operations Research , vol.45 , Issue.5 , pp. 662-676
    • Griggs, B.J.1    Parnell, G.S.2    Lemkuhl, L.J.3
  • 4
    • 4344576286 scopus 로고    scopus 로고
    • Strike force allocation with defender suppression
    • Industrial Engineering Department, Texas A&M University
    • V. C-W. Li, G. L. Curry, and E. A. Boyd. Strike force allocation with defender suppression. Technical report, Industrial Engineering Department, Texas A&M University, 1997.
    • (1997) Technical Report
    • Li, V.C.-W.1    Curry, G.L.2    Boyd, E.A.3
  • 5
    • 4344633659 scopus 로고
    • A survey and description of usaf conventional munitions allocation models
    • Office of Aerospace Studies, Kirtland AFB, Feb
    • K. A. Yost. A survey and description of usaf conventional munitions allocation models. Technical report, Office of Aerospace Studies, Kirtland AFB, Feb 1995.
    • (1995) Technical Report
    • Yost, K.A.1
  • 8
    • 0003986643 scopus 로고
    • Methods for competitive co-evolution: Finding opponents worth beating
    • Larry Eshelman, editor, San Francisco, CA, Morgan Kaufmann
    • Christopher D. Rosin and Richard K. Belew. Methods for competitive co-evolution: Finding opponents worth beating. In Larry Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 373-380, San Francisco, CA, 1995. Morgan Kaufmann.
    • (1995) Proceedings of the Sixth International Conference on Genetic Algorithms , pp. 373-380
    • Rosin, C.D.1    Belew, R.K.2
  • 11
    • 0001201756 scopus 로고
    • Some studies in machine learning using the game of checkers
    • A. L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3:210-229, 1959.
    • (1959) IBM Journal of Research and Development , vol.3 , pp. 210-229
    • Samuel, A.L.1
  • 12
    • 84862420793 scopus 로고    scopus 로고
    • Blizzard. Starcraft, 1998, www.blizzard.com/starcraft.
    • (1998)
  • 13
    • 84862412178 scopus 로고    scopus 로고
    • Cavedog. Total annihilation, 1997, www.cavedog.com/totala.
    • (1997)
  • 14
    • 4344637259 scopus 로고    scopus 로고
    • Relic Entertainment Inc. Homeworld, 1999, homeworld.sierra.com/hw
    • Relic Entertainment Inc. Homeworld, 1999, homeworld.sierra.com/hw.
  • 15
    • 0013030735 scopus 로고    scopus 로고
    • Research in human-level ai using computer games
    • John E. Laird. Research in human-level ai using computer games. Communications of the ACM, 45(1):32-35, 2002.
    • (2002) Communications of the ACM , vol.45 , Issue.1 , pp. 32-35
    • Laird, J.E.1
  • 18
    • 0032072480 scopus 로고    scopus 로고
    • Flying together: Modelling air mission teams
    • Gil Tidhar, Clinton Heinze, and Mario C. Selvestrel. Flying together: Modelling air mission teams. Applied Intelligence, 8(3):195-218, 1998.
    • (1998) Applied Intelligence , vol.8 , Issue.3 , pp. 195-218
    • Tidhar, G.1    Heinze, C.2    Selvestrel, M.C.3
  • 21
    • 0008136635 scopus 로고    scopus 로고
    • The basics of a* for path planning
    • Charles River media
    • Bryan Stout. The basics of a* for path planning. In Game Programming Gems, pages 254-262. Charles River media, 2000.
    • (2000) Game Programming Gems , pp. 254-262
    • Stout, B.1
  • 23
    • 0001334115 scopus 로고
    • The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination
    • Gregory J. E. Rawlins, editor, Morgan Kauffman
    • Larry J. Eshelman. The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In Gregory J. E. Rawlins, editor, Foundations of Genetic Algorithms-1, pages 265-283. Morgan Kauffman, 1991.
    • (1991) Foundations of Genetic Algorithms-1 , pp. 265-283
    • Eshelman, L.J.1


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