Human Players Versus Computer Games Bots: A Turing Test Based on Linguistic Description of Complex Phenomena and Restricted Equivalence Functions

2018 
This paper aims to propose a new version of the well-known Turing Test for computer game bots based on Linguistic Description of Complex Phenomena and Restricted Equivalence Functions whose goal is to evaluate the “believability” of the computer games bots acting in a virtual world. A data-driven software architecture based on Linguistic Modelling of Complex Phenomena is also proposed which allows us to automatically generate bots behavior profiles. These profiles can be compared with human players behavior profiles in order to provide us with a similarity measure of believability between them. In order to show and explore the possibilities of this new turing test, a web platform has been designed and implemented by one of authors.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    19
    References
    0
    Citations
    NaN
    KQI
    []