From the Publisher:

"This is the best general book on Genetic Algorithms written to date. It covers background, history, and motivation; it selects important, informative examples of applications and discusses the use of Genetic Algorithms in scientific models; and it gives a good account of the status of the theory of Genetic Algorithms. Best of all the book presents its material in clear, straightforward, felicitous prose, accessible to anyone with a college-level scientific background. If you want a broad, solid understanding of Genetic Algorithms -- where they came from, what's being done with them, and where they are going -- this is the book.
-- John H. Holland, Professor, Computer Science and Engineering, and Professor of Psychology, The University of Michigan; External Professor, the Santa Fe Institute. 
Genetic algorithms have been used in science and engineering as adaptive algorithms for solving practical problems and as computational models of natural evolutionary systems. This brief, accessible introduction describes some of the most interesting research in the field and also enables readers to implement and experiment with genetic algorithms on their own. It focuses in depth on a small set of important and interesting topics -- particularly in machine learning, scientific modeling, and artificial life -- and reviews a broad span of research, including the work of Mitchell and her colleagues. 
The descriptions of applications and modeling projects stretch beyond the strict boundaries of computer science to include dynamical systems theory, game theory, molecular biology, ecology, evolutionary biology, and population genetics, underscoring the exciting "general purpose" nature of genetic algorithms as search methods that can be employed across disciplines. 
An Introduction to Genetic Algorithms is accessible to students and researchers in any scientific discipline. It includes many thought and computer exercises that build on and reinforce the reader's understanding of the text. 
The first chapter introduces genetic algorithms and their terminology and describes two provocative applications in detail. The second and third chapters look at the use of genetic algorithms in machine learning (computer programs, data analysis and prediction, neural networks) and in scientific models (interactions among learning, evolution, and culture; sexual selection; ecosystems; evolutionary activity). Several approaches to the theory of genetic algorithms are discussed in depth in the fourth chapter. The fifth chapter takes up implementation, and the last chapter poses some currently unanswered questions and surveys prospects for the future of evolutionary computation.

/pdf/an-introduction-to-genetic-algorithms-32faq13a56.pdf

An Introduction to Genetic Algorithms

What can computer simulation contribute to the social sciences? Which of the many approaches to simulation would be best for my social science project? How do I design, carry out and analyse the results from a computer simulation? This is a practical textbook on the techniques of building computer simulations to assist understanding of social and economic issues and problems. Interest in social simulation has been growing rapidly worldwide as a result of increasingly powerful hardware and software and also a rising interest in the application of ideas of complexity, evolution, adaptation and chaos in the social sciences. This authoritative book details all the common approaches to social simulation, to provide social scientists with an appreciation of the literature and allow those with some programming skills to create their own simulations.New for this edition is a chapter on how to use simulation as a tool. A new chapter on multi-agent systems has also been added to support the fact that multi-agent modelling has become the preferred approach to simulation. Social scientists in a wide range of fields will find this book an essential tool for research, particularly in sociology, economics, anthropology, geography, organizational theory, political science, social policy, cognitive psychology and cognitive science. It will also appeal to computer scientists interested in distributed artificial intelligence, multi-agent systems and agent technologies.

Simulation for the Social Scientist

Natural systems from snowflakes to mollusc shells show a great diversity of complex patterns. The origins of such complexity can be investigated through mathematical models termed ‘cellular automata’. Cellular automata consist of many identical components, each simple., but together capable of complex behaviour. They are analysed both as discrete dynamical systems, and as information-processing systems. Here some of their universal features are discussed, and some general principles are suggested.

Cellular automata as models of complexity

Winning ways (for your mathematical plays), vols 1 and 2, by Elwyn R. Berlekamp, John H. Conway and Richard K. Guy. Pp 469 and 475. £10·80 each. 1982. ISBN 0-12-091101-9/02-7 (Academic Press)

Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect Graphs. Geometric and Combinatorial Graphs. Algorithms. Constructions. Edge Colorings. Orientations and Flows. Chromatic Polynomials. Hypergraphs. Infinite Chromatic Graphs. Miscellaneous Problems. Indexes.

/pdf/graph-coloring-problems-4v7vijos3s.pdf

Graph Coloring Problems

This monograph contains discussions of hundreds of open questions, organized into 185 different topics. They represent aspects of number theory and are organized into six categories: prime numbers, divisibility, additive number theory, Diophantine equations, sequences of integers, and miscellaneous. To prevent repetition of earlier efforts or duplication of previously known results, an extensive and up-to-date collection of references follows each problem. In this second edition, new material has been added in addition to corrections.

Unsolved Problems in Number Theory

In the quarter of a century since three mathematicians and game theorists collaborated to create Winning Ways for Your Mathematical Plays, the book has become the definitive work on the subject of mathematical games. Now carefully revised and broken down into four volumes to accommodate new developments, the Second Edition retains the original's wealth of wit and wisdom. The authors' insightful strategies, blended with their witty and irreverent style, make reading a profitable pleasure. In Volume 3, the authors examine Games played in Clubs, giving case studies for coin and paper-and-pencil games, such as Dots-and-Boxes and Nimstring. From the Table of Contents: - Turn and Turn About - Chips and Strips - Dots-and-Boxes - Spots and Sprouts - The Emperor and His Money - The King and the Consumer - Fox and Geese; Hare and Hounds - Lines and Squares

Winning Ways for your Mathematical Plays

Mathematicians and non-mathematicians alike have long been fascinated by geometrical problems, particularly those that are intuitive in the sense of being easy to state, perhaps with the aid of a simple diagram. Each section in the book describes a problem or a group of related problems. Usually the problems are capable of generalization of variation in many directions. The book can be appreciated at many levels and is intended for everyone from amateurs to research mathematicians. This monograph on geometry is intended for undergraduate and graduate students of mathematics.

Unsolved problems in geometry

In THE BOOK OF NUMBERS, two famous mathematicians fascinated by beautiful and intriguing number patterns share their insights and discoveries with each other and with readers. John Conway is the showman, master of mathematical games and flamboyant presentations; Richard Guy is the encyclopedist, always on top of problems waiting to be solved. Together they show us why patterns and properties of numbers have captivated mathematicians and non-mathematicians alike for centuries. THE BOOK OF NUMBERS features Conway and Guy's favorite stories about all the kinds of numbers any of us is likely to encounter, and many others besides. "Our aim," the authors write, "is to bring to the inquisitive reader. . .an explanation of the many ways the word 'number' is used." They explore patterns that emerge in arithmetic, algebra, and geometry, describe these pattern' relevance both inside and outside mathematics, and introduce the strange worlds of complex, transcendental, and surreal numbers. This unique book brings together facts, pictures and stories about numbers in a way that no one but an extraordinarily talented pair of mathematician/writers could do.

The Book of Numbers

Some readers know to play the game of nim well, fewer play a perfect annihilation game, and nobody knows whether there exists an opening move in chess that will guarantee a win for white. These games and many more, belong to the family of combinatorial games, by which we mean the set of all two-player perfect-information games without chance moves and with outcomes lose or win (and sometimes: dynamic tie). The motivation for ONAG may have been, and perhaps was-and I would like to think that it was-the attempt to bridge the theory gap between nim-like and chess-like games. Why is there a gap? Every combinatorial game can be described as a directed graph called game-graph, whose vertices are the game positions, and (u, v) is a directed edge if and only if there is a move from position u to position v. Denote by N the set of all positions from which the Next (first) player can force a win; by P the set of all positions from which the Previous (second) player can force a win; and by T the set of all (dynamic) Tie positions, which are positions from which no player can force a win and therefore both can avoid losing. In an acyclic game-graph there cannot be any tie positions. The N, P, T classification of any game graph R = (V, E) can be determined in 0(\V\ + \E\) steps [8]. For both nim and chess, a finite game-graph can be constructed and the N, P, T classification can be determined. So both games are solvable in principle. If we play nim with n piles, each pile containing at most k tokens, then the game-graph contains (k + \) vertices. Suppose that in (generalized) chess played on an « X « board there are k different pieces. If k is about n/2, then the game-graph of chess contains O (2") vertices. So both game-graphs have exponentially many vertices, and thus both games appear intractable in the usual sense of computational complexity [1, Chapter 10], [14, Chapter 9], namely a computation appears to be required which is asymptotically exponential. From a computational efficiency standpoint, the essential difference between nim and chess is that nim can be viewed as a disjunctive compound (sum) of independent games, namely the individual piles. A disjunctive

http://ieeexplore.ieee.org/iel5/5/31266/01455274.pdf

Richard K. Guy

Papers

Unsolved Problems in Number Theory

Winning Ways for your Mathematical Plays

Unsolved problems in geometry

The Book of Numbers

On numbers and games