All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

An Artificial Player for a Turn-based Strategy Game

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F17%3A50013523" target="_blank" >RIV/62690094:18450/17:50013523 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-319-54472-4_43" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-54472-4_43</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-54472-4_43" target="_blank" >10.1007/978-3-319-54472-4_43</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    An Artificial Player for a Turn-based Strategy Game

  • Original language description

    This paper describes the design of an artificial intelligent opponent in the Empire Wars turn-based strategy computer game. Several approaches to make the opponent in the game, that has complex rules and a huge state space, are tested. In the first phase, common methods such as heuristics, influence maps, and decision trees are used. While they have many advantages (speed, simplicity and the ability to find a solution in a reasonable time), they provide rather average results. In the second phase, the player is enhanced by an evolutionary algorithm. The algorithm adjusts several parameters of the player that were originally determined empirically. In the third phase, a learning process based on recorded moves from previous games played is used. The results show that incorporating evolutionary algorithms can significantly improve the efficiency of the artificial player without necessarily increasing the processing time.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Intelligent Information and Database Systems

  • ISBN

    978-3-319-54471-7

  • ISSN

    0302-9743

  • e-ISSN

    neuvedeno

  • Number of pages

    11

  • Pages from-to

    455-465

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Kanazawa

  • Event date

    Apr 3, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article