In 1933 David Champernowne had noticed and published a simple but new result about normal numbers, introducing the Champernowne constant formed by concatenating positive integers ^{[4]}^{[5]}^{[6]}. Kurt Mahler later showed it to also be transcendental^{[7]}.

C10 = 0.12345678910111213141516... ^{[8]}^{[9]}

It seems very possible that Turing's interest in the constructive definition of real numbers was stimulated by Champernowne's work, he took up this topic with some new results, and his manuscript notes were written on the back of the typescript of his 1936 paper On computable numbers^{[10]}^{[11]}.

Turochamp

In 1948 Turing and Champernowne devised a chess playing program which they called Turochamp, which incorporated important methods of evaluation^{[12]}. Champernowne later gave this description of Turochamp ^{[13]}:

Most of our attention went to deciding which moves were to be followed up. My memory about this is infuriatingly weak, Captures had to be followed up at least to the point where no further captures was immediately possible. Check and forcing moves had to be followed further. We were particularly keen on the idea that whereas certain moves would be scorned as pointless and pursued no further others would be followed quite a long way down certain paths. In the actual experiment I suspect we were a bit slapdash about all this and must have made a number of slips since the arithmetic was extremely tedious with pencil and paper. Our general conclusion was that a computer should be fairly easy to programme to play a game of chess against a beginner and stand a fair chance of winning or least reaching a winning position.

Turing played an important role in the development of computers in Britain. Together with his friend David Champernowne he invented "round-the-house" chess: after you move, run around the house, if you get back before your opponent's move you are entitled to a new move.

^ Chapter 16, Introduction on 'Chess', in Alan Turing, Jack Copeland (editor) (2004). The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books

## Table of Contents

Home * People * David ChampernowneDavid Gawen Champernowne, (July 09, 1912 - August 19, 2000^{[1]})was an English mathematician and economist who picked a hole in John Maynard Keynes's General Theory of Employment, Interest and Money

^{[2]}and 'built a chess computer' with Alan Turing^{[3]}, a long-time friend from the time that they were undergraduates together at King's College, Cambridge.## Champernowne constant

In 1933 David Champernowne had noticed and published a simple but new result about normal numbers, introducing the Champernowne constant formed by concatenating positive integers^{[4]}^{[5]}^{[6]}. Kurt Mahler later showed it to also be transcendental^{[7]}.C10 = 0.12345678910111213141516...

^{[8]}^{[9]}It seems very possible that Turing's interest in the constructive definition of real numbers was stimulated by Champernowne's work, he took up this topic with some new results, and his manuscript notes were written on the back of the typescript of his 1936 paper

On computable numbers^{[10]}^{[11]}.## Turochamp

In 1948 Turing and Champernowne devised a chess playing program which they called Turochamp, which incorporated important methods of evaluation^{[12]}. Champernowne later gave this description of Turochamp^{[13]}:Most of our attention went to deciding which moves were to be followed up. My memory about this is infuriatingly weak, Captures had to be followed up at least to the point where no further captures was immediately possible. Check and forcing moves had to be followed further. We were particularly keen on the idea that whereas certain moves would be scorned as pointless and pursued no further others would be followed quite a long way down certain paths. In the actual experiment I suspect we were a bit slapdash about all this and must have made a number of slips since the arithmetic was extremely tedious with pencil and paper. Our general conclusion was that a computer should be fairly easy to programme to play a game of chess against a beginner and stand a fair chance of winning or least reaching a winning position.

Turing started to code the Turochamp for Ferranti Mark 1 computer at Manchester University but he never competed the task.

## Round-the-house Chess

Quote fromFirst Law^{[14]}^{[15]}:Turing played an important role in the development of computers in Britain. Together with his friend David Champernowne he invented "round-the-house" chess: after you move, run around the house, if you get back before your opponent's move you are entitled to a new move.## Selected Publications

1933).The construction of decimals normal in the scale of ten. Journal of the London Mathematical Society, vol. 8, p. 254-2601969).Uncertainty and estimation in economics. Holden Day, ISBN-13: 978-0050020067, google book, amazon1998).Economic inequality and income distribution. Cambridge University Press, ISBN-13: 978-0521589598, google book, amazon^{[16]}^{[17]}## External Links

## References

2000).Some Cambridge reactions to The General Theory: David Champernowne and Joan Robinson on full employment. pdf1933).The construction of decimals normal in the scale of ten. Journal of the London Mathematical Society, vol. 8, p. 254-2601937).Arithmetische Eigenschaften einer Klasse von Dezimalbrüchen. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Ser. A. 40, p. 421-4281936).On computable numbers, with an application to the Entscheidungsproblem. pdf2004).The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books2003).Chess-boxing and Entertainments. ChessCafe.com, pdf## What links here?

Up one level