What can be regarded as artificial intelligence in games? To put it simply, it is generally a code that arrives at “intelligent” answers through reviewing information relevant to the game.

The two fields have been inseparably intertwined since the beginning of computing history: analogies between chess and computers were already studied by Alan Turing (1912-1954). In a lecture delivered at the London Mathematical Society on 20 February 1947, Turing was the first to propose testing artificial intelligence with the game of chess.

He argued that computers, like humans, should be given a great deal of training and practice before their intelligence was tested, adding that mathematicians also underwent extensive training. And one of the most obvious methods of testing intelligence is offered by playing chess.

Later on he put his theory into practice. He wrote a chess programme in 1952. Since he felt that existing computers would not be fast enough to run the programme, he himself simulated a computer that would take half an hour to make a move. The game opened with the Vienna game Falkbeer variation, and Turing’s computer lost after 29 moves.