The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A Turing Test for Computer Game Bots
Abstract
In this paper, a version of the Turing Test is proposed, to test the ability of computer game playing agents (ldquobotsrdquo) to imitate human game players. The proposed test has been implemented as a bot design and programming competition, the 2K BotPrize Contest. The results of the 2008 competition are presented and analyzed. We find that the Test is challenging, but that current techniques show promise. We also suggest probable future directions for developing improved bots.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290 · cited 2×
“The Turing Test was first proposed in Alan Turing’s 1950 paper [ 1 ], in which Turing considers the question “Can a Machine Think?” He rejects argument based on semantic word play, labeling the question meaningless, proposing instead an objective test that we now know as the Turing Test.”
MethodSearle, J. R. (1980) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00005756 · Cited by 6,954
Pinar Saygin, A., Cicekli, I., & Akman, V. (2000) · Minds and Machines · doi:10.1023/a:1011288000451 · Cited by 383 · cited 1×
“The exposition of these responses is influenced by Saygin et al.'s review of the Turing Test [13], though we have given our own interpretations and omitted parts that do not seem relevant for our purposes.”
BackgroundLessons from a Restricted Turing Test
Shieber, S. M. (1994) · arXiv · doi:10.48550/arxiv.cmp-lg/9404002 · Cited by 222
Robotic Mapping and Exploration
Stachniss, C. (2009) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-642-01097-2 · Cited by 178
Cited by
SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient
Yu, L., Zhang, W., Wang, J., & Yu, Y. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10804 · Cited by 2,285
Survey on Chatbot Design Techniques in Speech Conversation Systems
A., S., & John, D. (2015) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2015.060712 · Cited by 479
“The scale of nonhuman to human is from 1 to 4 and the judge must evaluate the Chatbot in this range [16].”
BackgroundYannakakis, G. N. (2012) · Proceedings of the 9th conference on Computing Frontiers · doi:10.1145/2212908.2212954 · Cited by 179
Demystifying Social Bots: On the Intelligence of Automated Social Media Actors
Assenmacher, D., Clever, L., Frischlich, L., Quandt, T., Trautmann, H., & Grimme, C. (2020) · Social Media + Society · doi:10.1177/2056305120939264 · Cited by 100
Obstacle Tower: A Generalization Challenge in Vision, Control, and Planning
Juliani, A., Khalifa, A., Berges, V.-P., Harper, J., Teng, E., Henry, H., Crespi, A., Togelius, J., & Lange, D. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/373 · Cited by 93
Metadata
- Authors
- Hingston, P.
- Venue
- IEEE Transactions on Computational Intelligence and AI in Games
- Published
- 2009-09
- Volume
- 1
- Issue
- 3
- Pages
- 169-186
- ISSN
- 1943-068X (ISSN-L)
- 1943-0698
- OpenAlex
- W2151162056
- Cited by
- 167
- References
- 5
- FWCI
- 13.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Turing Test for Computer Game Bots. https://app.cochat.ai/papers/10.1109/tciaig.2009.2032534
- The paper
- Hingston, P. (2009). A Turing Test for Computer Game Bots. IEEE Transactions on Computational Intelligence and AI in Games. https://doi.org/10.1109/tciaig.2009.2032534
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.