Games, computers and artificial intelligence
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
The chess machine: an example of dealing with a complex task by adaptation
AFIPS '55 (Western) Proceedings of the March 1-3, 1955, western joint computer conference
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Some necessary conditions for a master chess program
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Some studies in machine learning using the game of checkers
IBM Journal of Research and Development
Some studies in machine learning using the game of checkers
IBM Journal of Research and Development
Evolving board-game players with genetic programming
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Opponent classification in poker
SBP'10 Proceedings of the Third international conference on Social Computing, Behavioral Modeling, and Prediction
| Hi-index | 0.00 |
A large part of any mathematical programme is concerned with operations which are not strictly mathematical at all. Examples of this are the input and output routines, the arrangements for calling in various sub-routines when required and, above all, the general organization of the problem as a whole. It is an interesting fact that these non-mathematical parts of the programme often take many more instructions than the mathematics proper. As an example, in a problem which involved the step by step integration of a simple non-linear differential equation, the actual integration cycle used 70 instructions, the arrangements to print out the results and to stop the integration at the required point used a further 48 instructions and a printing sub-routine of 64 instructions - a total of 112 instructions. The problem required this integration to be performed a large number of times with different parameters; the organization involved in doing this, and in arranging that the parameters should be fed into the machine in the simplest possible form used no fewer than 250 instructions and sub-routines totalling about 150 instructions. This may be a rather extreme case. but it is generally true to say, I think, that the non-mathematical parts of the programme use far more instructions than one would at first sight expect, and that a relatively large part of effort in preparing the programme is spent dealing with these non-mathematical operations.