John Nunn

From Wikipedia, the free encyclopedia

John Denis Martin Nunn (born April 25, 1955 in London) is an English chess player and mathematician.

John Nunn went up to Oriel College, Oxford, to study mathematics when he was only 15 years of age in 1970. At the time, it was said that he was Oxford's youngest undergraduate since Cardinal Wolsey. He graduated in 1973, gained his doctorate in 1978 and remained at Oxford University as a mathematics lecturer until 1981, when he became a professional chess player. One of England's strongest players, and once in the world's top ten, Nunn has twice won individual gold medals at Chess Olympiads. He gained the International Grandmaster title in 1978 and in the same year was awarded his doctorate in mathematics by University of Oxford for a thesis on finite H-spaces. In 1989 he finished sixth in the inaugural (and only) World Cup, a series of tournaments in which the top 25 players in the world competed. His best performance in the World Chess Championship came in 1987, when he lost a playoff match against Lajos Portisch for a place in the Candidates Tournament.

As well as being a strong player, Nunn is regarded as one of the best contemporary authors of chess books. He has penned many volumes, including Secrets of Grandmaster Chess which won the British Chess Federation Book of the Year award in 1988 and John Nunn's Best Games which took the award in 1995. He is the director of chess publishers Gambit Publications.

Nunn is also involved with chess problems, composing several examples and solving as part of the British team on several occasions. On this subject he wrote Solving in Style (1985). He won the World Chess Solving Championship in Halkidiki, Greece, in September 2004 and also made his final GM norm in problem solving. He is the third person ever to gain both over-the-board and solving GM titles (the others being Jonathan Mestel and Ram Soffer).

Since the mid-1990s Nunn has been actively working on data mining from chess endgame tablebases. The offshoots of this work includes the books Secrets Of Rook Endings, Secrets of Minor-Piece Endings, and Secrets Of Pawnless Endings. These books include human-usable endgame strategies found by Nunn (and others) by extensive experimentation with tablebases, and new editions have come out and are due as more tablebases are created and tablebases are more deeply data-mined. Nunn is thus as of 2004 the foremost data miner of chess endgame tablebases. This work corresponds to the endgame part of the work of Berlekamp, Conway et al in dots-and-boxes, Hex and other games.

On the April 2005 FIDE list, Nunn had an Elo rating of 2617, making him number 98 in the world and England's number four (behind Michael Adams, Nigel Short and Luke McShane).

He is married to Petra Fink-Nunn, a German chess player with the title Woman FIDE Master.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.