Instant Ebook Access, One Click Away – Begin at ebooknice.

com

(Ebook) Learning Genetic Algorithms with Python:

Empower the performance of Machine Learning and AI
models with the capabilities of a powerful search
algorithm by Gridin, Ivan ISBN 9788194837756,
8194837758
https://ebooknice.com/product/learning-genetic-algorithms-
with-python-empower-the-performance-of-machine-learning-and-
ai-models-with-the-capabilities-of-a-powerful-search-
algorithm-34733686

OR CLICK BUTTON

DOWLOAD EBOOK

Get Instant Ebook Downloads – Browse at https://ebooknice.com

 Instant digital products (PDF, ePub, MOBI) ready for you
Download now and discover formats that fit your needs...

Start reading on any device today!

(Ebook) Genetic Algorithms and Machine Learning for Programmers: Create AI Models
and Evolve Solutions by Frances Buontempo ISBN 9781680506204, 168050620X

https://ebooknice.com/product/genetic-algorithms-and-machine-learning-for-
programmers-create-ai-models-and-evolve-solutions-9945182

ebooknice.com

(Ebook) Practical Machine Learning with H2O: Powerful, Scalable Techniques for Deep
Learning and AI by Darren Cook ISBN 9781491964606, 149196460X

https://ebooknice.com/product/practical-machine-learning-with-h2o-powerful-
scalable-techniques-for-deep-learning-and-ai-5733694

ebooknice.com

(Ebook) Adaptive Machine Learning Algorithms with Python: Solve Data Analytics and
Machine Learning Problems on Edge Devices by Chanchal Chatterjee ISBN 9781484280164,
1484280164

https://ebooknice.com/product/adaptive-machine-learning-algorithms-with-python-
solve-data-analytics-and-machine-learning-problems-on-edge-devices-42829800

ebooknice.com

(Ebook) Ultimate Machine Learning with ML.NET: Build, Optimize, and Deploy Powerful
Machine Learning Models for Data-Driven Insights by Kalicharan Mahasivabhattu ,
Deepti Bandi ISBN B0D8L3Q283

https://ebooknice.com/product/ultimate-machine-learning-with-ml-net-build-
optimize-and-deploy-powerful-machine-learning-models-for-data-driven-
insights-58283328

ebooknice.com
(Ebook) Introduction To Conformal Prediction With Python : A Short Guide For
Quantifying Uncertainty Of Machine Learning Models by Christoph Molnar

https://ebooknice.com/product/introduction-to-conformal-prediction-with-python-
a-short-guide-for-quantifying-uncertainty-of-machine-learning-models-49150962

ebooknice.com

(Ebook) Practical machine learning with H2O: powerful, scalable techniques for deep
learning and AI by Cook, Darren ISBN 9780123456786, 9780204940494, 9781491964606,
0123456789, 0204940494, 149196460X

https://ebooknice.com/product/practical-machine-learning-with-h2o-powerful-
scalable-techniques-for-deep-learning-and-ai-11372872

ebooknice.com

(Ebook) Python Machine Learning. Machine Learning and Deep Learning with Python,
scikit-learn and TensorFlow by Sebastian Raschka, Vahid Mirjalili ISBN
9781787125933, 1787125939

https://ebooknice.com/product/python-machine-learning-machine-learning-and-deep-
learning-with-python-scikit-learn-and-tensorflow-6868034

ebooknice.com

(Ebook) Learn TensorFlow 2.0: Implement Machine Learning and Deep Learning Models
with Python by Pramod Singh , Avinash Manure ISBN 9781484255582, 1484255585

https://ebooknice.com/product/learn-tensorflow-2-0-implement-machine-learning-
and-deep-learning-models-with-python-50195358

ebooknice.com

(Ebook) Machine Learning with LightGBM and Python by anonymous

https://ebooknice.com/product/machine-learning-with-lightgbm-and-python-55462132

ebooknice.com
 Learning Genetic
Algorithms with
Python

Empower the Performance of

Machine Learning and AI Models with the
Capabilities of a Powerful Search Algorithm

Ivan Gridin

www.bpbonline.com
FIRST EDITION 2021

Copyright © BPB Publications, India

ISBN: 978-81-94837-756

All Rights Reserved. No part of this publication may be

reproduced, distributed or transmitted in any form or by any
means or stored in a database or retrieval system, without the
prior written permission of the publisher with the exception to the
program listings which may be entered, stored and executed in a
computer system, but they can not be reproduced by the means
of publication, photocopy, recording, or by any electronic and
mechanical means.

LIMITS OF LIABILITY AND DISCLAIMER OF WARRANTY

The information contained in this book is true to correct and the

best of author’s and publisher’s knowledge. The author has made
every effort to ensure the accuracy of these publications, but
publisher cannot be held responsible for any loss or damage
arising from any information in this book.

All trademarks referred to in the book are acknowledged as

properties of their respective owners but BPB Publications cannot
guarantee the accuracy of this information.

Distributors:
BPB PUBLICATIONS

20, Ansari Road, Darya Ganj

New Delhi-110002

Ph: 23254990/23254991

MICRO MEDIA

Shop No. 5, Mahendra Chambers,

150 DN Rd. Next to Capital Cinema,

V.T. (C.S.T.) Station, MUMBAI-400 001

Ph: 22078296/22078297

DECCAN AGENCIES

4-3-329, Bank Street,

Hyderabad-500195

Ph: 24756967/24756400
BPB BOOK CENTRE

376 Old Lajpat Rai Market,

Delhi-110006

Ph: 23861747

Published by Manish Jain for BPB Publications, 20 Ansari Road,

Darya Ganj, New Delhi-110002 and Printed by him at Repro India
Ltd, Mumbai

www.bpbonline.com
 Dedicated to:

My lovely little daughters: Ksenia and Elena.

Your endless love and energy charge me every day.

And to my beautiful and patient wife Tamara.

That’s all thanks to you. You are the light of my life.

I love you
 About the Author

Ivan Gridin is a Mathematician, Fullstack Developer, Data Scientist,

and Machine Learning Expert living in Moscow, Russia. Over the
years, he worked on distributive high-load systems and
implemented different machine learning approaches in practice.
One of the key areas of his research is the design and analysis of
predictive time series models.

Ivan has fundamental math skills in probability theory, random

process theory, time series analysis, machine learning, deep
learning, and optimization. He also has in-depth knowledge and
understanding of various programming languages such as Java,
Python, PHP, and MATLAB.

Loving father, husband, and collector of old math books.

Linkedin: http://www.linkedin.com/in/survex/
 About the Reviewer

Satyajeet Dhawale is a professional Data Scientist having a strong

experience in machine learning, deep learning, computer vision,
inferential and descriptive statistical analysis. He has worked on
many projects that involve complex machine learning and deep
learning algorithms and used a variety of data sets from a
different domain. In his career, he has successfully delivered many
machine learning and deep learning solutions for complex data
problems. You can find more professional details about Satyajeet
on LinkedIn.
 Acknowledgement

There are a few people I want to thank for the idea and the
motivation for writing this book. I thank my adorable wife Tamara;
her patience and beauty inspired me every day. I thank my elder
daughter Ksenia; her courage and determination motivated me in
exhaustion moments. And my little daughter Elena for waking me
up earlier – you’re my energizer!

Thanks to my mom for her love and the genetics she gave me.

I am eternally grateful to my company AT Consulting. This

company has done a lot to make me the specialist I am. And I
especially want to thank Alexey Korotaev - one of the best
managers I’ve ever seen. I’m proud to be a part of this big team.

Thanks to my friends, who helped me in all my endeavors. To

Petr Rostov for his help in learning mathematics and
programming. To my friend Yuri Babaev for his inspiration and
humor that he brings into my life. To Denis Paramanov for
sacrificing his vacation for my future wife and me. To Dmitry
Suvorov for his effective gym workout. To Sergey Korsikov and
Alena Gulyaeva for helping us to get used to this big city. This
book would be impossible without all of them.

I want to give the warmest hugs to my new big family in Perm

and Khabarovsk. I especially want to hug Konstantin Volosatov, the
most handsome and intelligent policeman I have ever met, and
his beautiful wife, Elena Volosatova. We love you all very much!

My gratitude also goes to the book reviewer Satyajeet Dhawale.

His participation and useful advice have made this book much
better.

Special thanks to BPB Publications for support, advice, and

assistance in creating and publishing this book.
 Preface

There is a lot of talk about Machine Learning, Deep Learning,

Neural Networks, and many other terms and technologies that
provides Artificial Intelligence in our life. These technologies are
used everywhere in our daily life. Image and terrain recognition
techniques are being used in autonomous vehicles that are already
driving worldwide. And the number of autonomous cars is
increasing at a tremendous rate.

Artificial intelligence frameworks and libraries are beginning to

penetrate very deeply into all areas of programming. An ordinary
programmer needs to have at least a basic understanding of what
machine learning is, what kind of tasks it solves, and how to
work with it. Machine learning contains a broad set of tools. Most
of the books and teaching materials describe only a few of them,
while the other approaches based on the evolutionary search for
solving problems remain uncovered.

This book is about Genetic Algorithms. It tells how the principles

formulated by Charles Darwin in his book “The Origin of Species”
in 1859 in our time help to solve the most complex problems that
contain billions and billions of solutions. Genetic Algorithms solve
problems that cannot be solved analytically. It mimics the process
of evolution and natural selection in a population, where each
individual represents a solution to a problem. The more vital
individuals from the population outlive the weaker ones and
produce the next generation of individuals. So after the evolution
process, after many generations, we get some solution to the
problem, which will highly likely satisfy the requirements.

The main disadvantage of most machine learning tools can be

formulated following way:

“They solve problems, but they don’t solve the problem - how to
solve problems.”

Genetic algorithms provide a method for solving a problem, i.e.,

how to solve problems in the absence of human experience.

Genetic algorithms are a relatively simple and very effective

method for solving a large class of problems. They are intuitive,
simple, and can be an excellent introduction to machine learning.

The book consists of thirteen chapters, in which the reader will

learn the following:

Chapter 1 is the introductory chapter giving the basic principles of

evolution. It defines the genetic algorithm, the genetic algorithm’s
nature, its applicability, and the pros and cons.

Chapter 2 will discuss genetic algorithm architecture, its main

logical concepts: individual, fitness function, population, selection,
crossover, and mutation.
Chapter 3 will focus solely on the Selection method. It explains
the selection in the sense of evolution, how it works, and how it
affects the evolution process. We will cover the following selection
methods: Tournament Selection, Proportional Selection, Stochastic
universal sampling Selection, Rank Selection, Elite Selection.

Chapter 4 concentrates only on the Crossover operation. It

describes the crossover, why it is important, how it works, and
how it influences the solution search. We will study the following
crossover methods: One Point Crossover, N-Point Crossover,
Uniform Crossover, Linear Combination Crossover, Blend Crossover,
Order Crossover, and Fitness Driven Crossover.

Chapter 5 discusses the last evolution operation called Mutation.

Evolution would be impossible without the Mutation, and it is one
of the most crucial parts of the genetic algorithm. Following
mutation methods are discussed: Random Deviation Mutation,
Exchange Mutation, Shift Mutation, Bit Flip Mutation, Inversion
Mutation, Shuffle Mutation, and Fitness Driven Mutation.

Chapter In this chapter, we will explore a way to compare the

effectiveness of architectures of genetic algorithms. It defines what
the best individual is. Explore the Genetic Algorithm as a random
variable and cover the handy technique to compare two random
variables called Monte-Carlo simulation.

Chapter 7 is the last theoretical chapter and is dedicated to

parameter tuning. It shows how global parameters like population
size, crossover, and mutation probability govern genetic algorithm
flow dynamics. It studies each parameter influence and explains
how each parameter affects the algorithm intuitively.

Chapter 8 starts the practical section of real-world problems. It

covers one of the most common tasks - finding the black-box
function’s maxima. It covers which types of individuals can be
created and design genetic algorithm architecture for this task.

Chapter 9 covers the first type of combinatorial problems, named

binary encoded combinatorial problems. It designs the solution for
the classical knapsack and schedule problem. And also, we will
study a complex radar problem.

Chapter 10 studies the second type of combinatorial problem

called ordered encoded combinatorial problems. Here we will
discuss the traditional traveling salesman problem; also, we will
investigate an original football manager problem.

Chapter 11 shows some other types of problems. It shows how to

solve the general system of equations using genetic algorithms
and another common graph coloring problem.

Chapter 12 brings the genetic algorithm to another level, from

Machine Learning to Deep Learning. It shows how to design an
adaptive genetic algorithm that can be used as a universal
approach with self-tuning feature during the evolution process.

Chapter 13 is all about performance. It shows how to speed up

the genetic algorithm with various techniques.
 Downloading the code
bundle and coloured images:

Please follow the link to download the

Code Bundle and the Coloured Images of the book:

https://rebrand.ly/6ad4a

All the chapters have associated code scripts in the book’s Code
Bundle.

Some parts required for the code to run may not be included in
the text to save space. You should be able to run all of the code
by yourself.

Errata

We take immense pride in our work at BPB Publications and

follow best practices to ensure the accuracy of our content to
provide with an indulging reading experience to our subscribers.
Our readers are our mirrors, and we use their inputs to reflect
and improve upon human errors, if any, that may have occurred
during the publishing processes involved. To let us maintain the
quality and help us reach out to any readers who might be
having difficulties due to any unforeseen errors, please write to us
at :
[email protected]

Your support, suggestions and feedbacks are highly appreciated by

the BPB Publications’ Family.

Did you know that BPB offers eBook versions of every book
published, with PDF and ePub files available? You can upgrade to
the eBook version at www.bpbonline.com and as a print book
customer, you are entitled to a discount on the eBook copy. Get
in touch with us at [email protected] for more details.

At you can also read a collection of free technical articles, sign up

for a range of free newsletters, and receive exclusive discounts
and offers on BPB books and eBooks.
 BPB is searching for authors like you

If you're interested in becoming an author for BPB, please visit

www.bpbonline.com and apply today. We have worked with
thousands of developers and tech professionals, just like you, to
help them share their insight with the global tech community. You
can make a general application, apply for a specific hot topic that
we are recruiting an author for, or submit your own idea.

The code bundle for the book is also hosted on GitHub at In

case there's an update to the code, it will be updated on the
existing GitHub repository.

We also have other code bundles from our rich catalog of books
and videos available at Check them out!

PIRACY

If you come across any illegal copies of our works in any form
on the internet, we would be grateful if you would provide us
with the location address or website name. Please contact us at
[email protected] with a link to the material.

If you are interested in becoming an author

If there is a topic that you have expertise in, and you are
interested in either writing or contributing to a book, please visit

REVIEWS

Please leave a review. Once you have read and used this book,
why not leave a review on the site that you purchased it from?
Potential readers can then see and use your unbiased opinion to
make purchase decisions, we at BPB can understand what you
think about our products, and our authors can see your feedback
on their book. Thank you!

For more information about BPB, please visit

 Table of Contents

1. Introduction
Structure
1.1 Nature of genetic algorithm
1.2 Applicability of genetic algorithms
1.3 Pros and cons of genetic algorithms
1.4 Your first genetic algorithm
Conclusion
Questions

2. Genetic Algorithm Flow

Structure
2.1 Individual
2.2 Fitness function
2.3 Population
2.4 Selection
2.5 Crossover
2.6 Mutation
2.7 Genetic algorithm flow
Conclusion
Points to remember:
Multiple choice questions:
Answers
Questions
Key terms

3. Selection
Structure
Objectives
3.1 Tournament selection

3.2 Proportional selection

3.3 Stochastic universal sampling selection
3.4 Rank selection
3.5 Elite selection
Conclusion
Points to remember
Multiple choice questions
Answers
Key terms

4. Crossover
Structure
Objectives
4.1 One-point crossover
4.2 N-point crossover
4.3 Uniform crossover
4.4 Linear combination crossover
4.5 Blend crossover
4.6 Order crossover
4.7 Fitness driven crossover
Conclusion
Points to remember
Multiple choice questions
Answers
Questions
Key terms

5. Mutation
Structure
Objectives

5.1 Random deviation mutation

Random deviation mutation
5.2 Exchange mutation
5.3 Shift mutation
5.4 Bit flip mutation
5.5 Inversion mutation
5.6 Shuffle mutation
5.7 Fitness driven mutation
Conclusion
Points to remember
Multiple choice questions
Answers
Questions
Key terms

6. Effectiveness
Structure
Objectives
6.1 Best individual
6.2 Total number of individuals
6.3 Genetic algorithm as random variable
6.4 Monte-Carlo simulation
Conclusion
Points to remember
Multiple choice questions
Answers
Key terms
7. Parameter Tuning
Structure

Objectives
7.1 Population size
7.2 Crossover probability
7.3 Mutation probability
Conclusion
Points to remember
Multiple choice questions
Answers
Questions
Key terms

8. Black-Box Function
Structure
Objectives
8.1 What is Black-box function?
8.2 Gene encodings
8.3 Genetic algorithm architecture
Conclusion
Points to remember
Multiple choice questions
Answers
Questions
Key terms

9. Combinatorial Optimization – Binary Gene Encoding

Structure
Objectives
9.1 Knapsack problem
9.2 Schedule problem
9.3 Radar placement problem

Conclusion
Questions

10. Combinatorial Optimization – Ordered Gene Encoding

Structure
Objectives
10.1 Travelling Salesman Problem
10.2 Football manager problem
Conclusion
Questions

11. Other Common Problems

Structure
Objective
11.1 System of equations
11.2 Graph coloring problem
Conclusion
Questions

12. Adaptive Genetic Algorithm

Structure
Objectives
12.1 Evolutionary improvement rate
12.2 Evolutionary progress and population size
12.3 Evolutionary progress, crossover, and mutation probabilities
12.4 Evolutionary dead-end and premature termination of the
genetic algorithm
12.5 Example of adaptive genetic algorithm
12.6 Adaptive genetic algorithm versus Classical genetic algorithm

Best Fitness
Total Number of Individuals
Conclusion
Points to remember
Questions
Key terms

13. Improving Performance

Structure
Objectives
13.1 Calculating fitness function once
13.2 Fitness function caching
13.3 Coarsening values of genes
13.4 Parallel computing
13.5 Population snapshot
Conclusion

Index
 CHAPTER 1

Introduction

As we know, evolution is one of the most perfect adaptation

mechanisms. It is a way to achieve extraordinary and complex
solutions. Understanding the principles of evolution gave us a new
approach called genetic algorithms . We will now explore this
rather beautiful, simple, and effective approach to problem-solving.
Structure

In this chapter, we will discuss the following topics:

Nature of genetic algorithm

Applicability of genetic algorithms

Pros and cons of genetic algorithms

Your first genetic algorithm

1.1 Nature of genetic algorithm

The rapid development in AI is made possible for humans to

obtain solution to abstract problems. Complex computational
problems that are very difficult to solve by classical methods can
now be solved by AI.

One of the most powerful techniques to solve such complex

problems is genetic algorithms (GA), which is based on the
principle of an evolutionary approach.

In the late 60s, American researcher J. Holland proposed to find

solutions to optimization problems using methods and evolution
models of animal populations in nature. Since the evolution’s
basic laws were investigated and described by genetics, the
proposed approach was called genetic algorithms. GA is a
randomly directed search algorithm based on mechanisms of
natural selection and natural genetics. It implements the principle
of survival of the fittest, forming and changing the search
algorithm based on evolutionary modeling.

The basic steps in natural evolution are as follows:

Selection: According to Charles natural selection laws were

formulated in the book On the Origin of Species. The central
postulate is that individuals who can better solve problems, survive
and reproduce more. In GAs, each individual is a solution to some
problem. According to this principle, individuals who solve the
problem better have a greater chance of surviving and leaving
offsprings.

Crossover: This means that the offspring chromosome is made up

of parts that are derived from the parents’ chromosomes. This
principle was discovered in 1865 by G.

Mutation: In 1900, H. de Vries discovered the principle of random

change. Initially, this term was used to describe significant
changes in descendants’ properties that were not present in their
parents. By analogy, genetic algorithms use a similar mechanism
to change offspring’s properties, thereby increasing individuals’
diversity in a population.

Genetic algorithms have the following characteristics:

Easy to implement

Used for a wide range of tasks

They do not require any additional information about the nature

of the problem

Easy and convenient to parallelize

1.2 Applicability of genetic algorithms

As a solution, the GA tries to find the extremum of some

function that characterizes the quality of the solution to the
problem. Generally, the GA does not guarantee that the solution
found is the best of all that’s possible. Usually, this is not
required, but it is only important that the found solution satisfies
the meaning of the problem being solved.

The areas of application of GAs include the following:

Search for extremum of various functions

Finding the shortest paths (traveling salesman problem)

Combinatorial optimization

Tasks of placement and scheduling

Automatic programming tasks

AI tasks (choosing the structure and parameters of artificial neural

networks)

In real time scenarios, GAs are used to develop AI systems, like

designing tasks for aircraft routes at airports, finding the optimal
behavior of robots, problems of constructing investment portfolios,
and so on.
1.3 Pros and cons of genetic algorithms

Like any other approach to problem-solving, GAs have their pros

and cons as well. Understanding these features will allow you to
solvе the practical problems in a better way.

The pros of genetic algorithms are as follows:

A wide range of tasks to be solved: GA is successfully applied in

the following areas – combinatorial optimization, finance (portfolio
optimization), machine learning (feature extraction, neural network
hyper-parameter optimization), code-breaking, game theory, natural
sciences, and so on.

Ease of implementation: The algorithm implies the presence of

steps – natural selection, crossing, and mutation. This conceptual
simplicity makes this method available to a wide range of
developers.

Resistance to dynamic changes in problem conditions: The GA is

able to retrain if the conditions of the problem change when
searching for a solution.

The ability for self-adaptation: GAs are able, after a certain period
of evolution, to adapt to the conditions of the problem being
solved.
Ease of scaling: Can easily be used on big data where the data is
spread over the distributed systems. GAs, as a highly parallel
process, can be easily parallelized, which makes it possible to
proportionally accelerate the finding of a solution with an increase
in computing power.

Solving problems for which there is no solution experience: One

of the biggest advantages of GAs is their ability to investigate
problems for which there is no relevant solution experience. It
should be noted that expert assessments are often used to solve
difficult-to-formalize problems, but they sometimes give less
acceptable solutions than automated methods.

The cons of genetic algorithms are as follows:

The complexity of representing an individual in a population and

determining the fitness function.

For real problems, it is initially not-at-all obvious in what form it

is necessary to present a set of individual genes for a successful
solution to the problem, and also determine the assessment of
the quality of a particular individual.

The choice of parameters of the architecture of the GA.

There are no effective criteria for the termination of the algorithm.

Not effective for finding an extremum for smooth functions with
one extremum.

They require large enough computing resources.

When solving problems, there are cases of premature convergence,

and therefore, generally, they do not guarantee in finding the
global extremum.
1.4 Your first genetic algorithm

Well, let’s try to build our first GA solution. We will start from a
trivial example which shows us the basics.

Let’s say we have the following function, sin(x) - 0.2 * abs(x).

Refer to the following figure

Figure 1.1: sin(x) - |x|

We will find the maxima of the preceding function.

This function has several local maximums. All individuals in the
population in our GA will try to climb as high as possible.

Let’s see the GA in action. Execute the following code (we will
cover the details in future chapters)
ch1/your_first_genetic_algorithm.py :

Import part
import random
from typing import List

import numpy as np
import matplotlib.pyplot as plt

Auxiliary GA operations
def _utils_constraints(g, min, max):
if max and g > max:
g = max
if min and g < min:
g = min
return g

def crossover_blend(g1, g2, alpha, min = None, max = None):

shift = (1. + 2. * alpha) * random.random() - alpha
new_g1 = (1. - shift) * g1 + shift * g2
new_g2 = shift * g1 + (1. - shift) * g2

return _utils_constraints(new_g1, min, max),

_utils_constraints(new_g2, min, max)
def mutate_gaussian(g, mu, sigma, min = None, max = None):
mutated_gene = g + random.gauss(mu, sigma)
return _utils_constraints(mutated_gene, min, max)

def select_tournament(population, tournament_size):

new_offspring = []
for _ in range(len(population)):
candidates = [random.choice(population) for _ in
range(tournament_size)]
new_offspring.append(max(candidates, key = lambda ind:
ind.fitness))
return new_offspring

def func(x):
return np.sin(x) - .2 * abs(x)

def get_best(population):

best = population[0]
for ind in population:
if ind.fitness > best.fitness:
best = ind
return best

def plot_population(population, number_of_population):

best = get_best(population)
x = np.linspace(-10, 10)
plt.plot(x, func(x), ‘--’, color = ‘blue’)
plt.plot([ind.get_gene() for ind in population], [ind.fitness for ind in
population], ‘o’, color = ‘orange’)
plt.plot([best.get_gene()], [best.fitness], ‘s’, color = ‘green’)
plt.title(f”Generation number {number_of_population}”)
plt.show()
plt.close()

Individual class
class Individual:

def __init__(self, gene_list: List[float]) -> None:

self.gene_list = gene_list
self.fitness = func(self.gene_list[0])

def get_gene(self):
return self.gene_list[0]

@classmethod
def crossover(cls, parent1, parent2):
child1_gene, child2_gene = crossover_blend(parent1.get_gene(),
parent2.get_gene(), 1, -10, 10)
return Individual([child1_gene]), Individual([child2_gene])

@classmethod
def mutate(cls, ind):

mutated_gene = mutate_gaussian(ind.get_gene(), 0, 1, -10, 10)

return Individual([mutated_gene])

@classmethod
def select(cls, population):
return select_tournament(population, tournament_size = 3)
@classmethod
def create_random(cls):
return Individual([random.randrange(-1000, 1000) / 100])

GA flow
random.seed(52)
# random.seed(16) # local maximum
POPULATION_SIZE = 10
CROSSOVER_PROBABILITY = .8
MUTATION_PROBABILITY = .1
MAX_GENERATIONS = 10

first_population = [Individual.create_random() for _ in

range(POPULATION_SIZE)]
plot_population(first_population, 0)

generation_number = 0

population = first_population.copy()

while generation_number < MAX_GENERATIONS:

generation_number += 1

# SELECTION
offspring = Individual.select(population)

# CROSSOVER
crossed_offspring = []
for ind1, ind2 in zip(offspring[::2], offspring[1::2]):
if random.random() < CROSSOVER_PROBABILITY:

kid1, kid2 = Individual.crossover(ind1, ind2)

crossed_offspring.append(kid1)
crossed_offspring.append(kid2)
else:
crossed_offspring.append(ind1)
crossed_offspring.append(ind2)

# MUTATION
mutated_offspring = []
for mutant in crossed_offspring:
if random.random() < MUTATION_PROBABILITY:
new_mutant = Individual.mutate(mutant)
mutated_offspring.append(new_mutant)
else:
mutated_offspring.append(mutant)

population = mutated_offspring.copy()

plot_population(population, generation_number)

Now, let’s examine how individuals of each population behave

during each generation. Refer to the following graphs:
 Figure 1.2: Generation 1

In the preceding figure the first-generation is just the random

distribution of points on the curve. We denote the green point as
the highest.
 Figure 1.3: Generation 2

The second generation, as shown in the preceding figure produces

an individual on the top of the highest hill. But let’s see how
other individuals will behave.
 Figure 1.4: Generation 3

The third generation, as shown in the preceding figure shows an

interesting situation. The highest point moved a little bit right
from the top. This behavior is typical for genetic algorithms.
Evolution is the constant search for the best solution; it always
explores the nearest area trying to offer another slightly different
mechanism that suits better.
 Figure 1.5: Generation 4

In the fourth generation, as shown in the preceding figure we see

how the entire population begins to strive for the individual that
is at the top. The most successful individual in several
generations managed to share their genes with other members of
the population, which made them look like themselves.
 Figure 1.6: Generation 5

Closer! Almost all population individuals has reached the top, as

shown in the preceding figure
Another Random Scribd Document
with Unrelated Content
 +x y z

II. TOURING SEASON

October to end of April.
III. MOTOR CLUB
To facilitate matters, it is advisable to join the Royal Automobile Club (Secretary, J. W. Orde, 119, Piccadilly,
W.); or the Motor Union of Great Britain and Ireland (Secretary, Rees Reffreys, 1, Albemarle Street, W.); or the
Automobile Association (8, New Coventry Street), and the Touring Club de France, 65, Avenue de la Grande-
Armée, Paris.
These bodies supply information as to Customs formalities, routes, and all such matters, and issue a paper
called a Triptyque, which enables one to pay the Customs deposit through them, and thus obviate the necessity of
depositing the money with the Customs abroad. These clubs also issue valuable handbooks, giving the names of
hotels and repairers, also a list of Channel routes and their services, fares, and cost of car transport.
IV. CLOTHING
It is advisable to always carry loose-fitting wind-and weather-proof overcoats. A woollen overcoat, with the
above over it, is warmer and far less fatiguing than the heavy leather-lined motor coats often in use. Provide boxes
and bags that are water-and dust-proof, or have covers that are.

Given a certain knowledge of the principles of a modern reliable motor-car, it is possible to undertake a
Continental tour unaccompanied by a driver or mechanic. By so doing, the man of moderate means can take a
holiday abroad en automobile cheaper than he can at home, once he has got his car across the Channel.
Nevertheless, the owner should try to come to a definite understanding, before leaving home, with the makers
of the car regarding the prompt despatch of any spare parts that may be necessary through accidents or breakdowns
on the road.
Having decided to embark on such a trip, it is essential for the owner of the car to personally see that all tools,
etc., are carefully packed and locked in their respective compartments, and that the machine has a thorough
overhaul, at which the prospective man at the wheel is present.

The compiler of these notes assumes, of course, that the intending tourist has had some experience of touring
at home before plunging into the unknown.
V. CARRY ON THE CAR
1. The usual kit of tools.
2. A hack-saw and blow-lamp.
3. A good supply of inner tubes and a spare cover.
4. A coarse funnel to strain the oil (the oil obtained in France often contains rubbish and the petrol water).
5. A petrol-funnel and a wash-leather bag to prevent water getting into the petrol tank; a densometer to take
the specific gravity of petrol.
6. Overalls for dirty work, plenty of dusters, and some soap.
7. A sponge and wash-leather; also a coil of stout window-cord.
8. Tins of grease; spare tin of petrol and oil.
9. An electric inspection-lamp to fit to accumulators.
10. A tyre-pressure tester.
The following Books should also be carried
1. Royal Automobile Club, Motor Union, foreign handbook; also Touring Club de France’s Annuaire Général.
2. ‘Faults, and How to Find Them,’ by J. S. V. Bickford, B.A. 2s. 6d. Iliffe and Sons, Limited, 20, Tudor
Street, E.C.
3. A catalogue of the particular car taken abroad, containing sectional drawings of the car’s parts.
4. ‘The Autocar Automobile Dictionary,’ by Sigmund Krausz. 3s. 6d. Iliffe and Sons, Limited, 20, Tudor
Street, E.C.
5. A set of Taride maps, on cloth, covering the route.
 6. ‘The Motor Routes of France,’ by Gordon Home. 5s. A. and C. Black, 4, Soho Square, W.
7. Burroughs Wellcome and Co.’s ‘Tabloid Brand’ Motor-Car First-Aid Case.
VI. GENERAL REGULATIONS FOR FRANCE
1. A circulation permit (Permit de Circulation) and registered number must be obtained for car.
2. The driver must obtain a driving certificate (Certificat de Capacité), when two photographs of his head and
shoulders, about 1½ inches by 1¾ inches, must be produced.
3. Name-plates must be placed on the dash-board facing the driver, about the size of a visiting-card, and have
inscribed on them—

(a) Full name and address of owner of car.

(b) Name, horse-power, and engine-number of car.

4. Lighting Regulations.—Three lamps must be carried. The front one, on left (off) side, to show a green light;
the tail-light to be on left side, and to efficiently illuminate the number-plate. These lamps must be lit not later than
fifteen minutes after sunset.
5. Rule of Road.—Keep to right, overtake on left.
6. A bell or horn must be used, but the use of sirens is forbidden.
7. There is a uniform speed-limit of 30 kilometres (about 18 miles) per hour, but this is rarely, if ever,
enforced, except in and about the towns. Special speed-limits are often in force in towns and villages, notices to
this effect being displayed.
8. Octroi duties for petrol have to be paid on entering Paris and some of the larger towns. The officials, except
in the case of Paris, require you to pay only on the spare petrol—i.e., that not in the petrol-tank proper.

With regard to the daily mileage covered, as shown in the log, the writer thinks that to properly enjoy the tour,
and to do justice to what there is to see en route, one should take at least twice the twenty-eight days, especially if
the party consists of more than two or three. Otherwise, for a man driving and looking after his own car, no matter
how reliable, the trip might become too arduous for enjoyment, the opportunities for sight-seeing, as this book
demonstrates, being enormous.
If possible, all night-driving should be avoided. In the dark one cannot see the broken glass and rubbish in the
villages, nor is it easy to find the right road.
Even with a certain amount of night-driving the tour described in this book was accomplished with a very
small outlay in tyres, which were Dunlops. Five new covers and an old one on the Stepney wheel and eight air-
tubes were found to be ample, owing to the excellent manner in which they stood the strain of rough surfaces and
sometimes fast driving.
FRENCH ROAD WARNING NOTICES

Ralentir Drive slowly.

Ralentissez Reduce speed.
Passage à niveau Level-crossing.
Cassis or caniveau Shallow drain across road.
Cylindre de vapeur Steam-roller.
Attention! Warning.

ITALIAN ROAD WARNING NOTICES

Rallentare Drive slowly.

Arresto Stop.
Cunetta Open drain.
Passaggio a livello Level-crossing.
Discesa pericolosa Dangerous hill.
Strada interrotta Road up.
Svolta pericolosa Dangerous turning.
 FRENCH ROAD SIGNS

Sharp turning to the right

Sharp turning to the left
Turning with descent
Dangerous crossing
Steep ascent
Steep descent
Winding descent with sharp turning
Archway
Level-crossing (passage à niveau)
Rails projecting above the road
Shallow drain across road (cassis or caniveau)
Bad paving (mauvais pavé)
Humpy road
 LOG OF A 15-20 H.-P. CAR FROM MARCH 24 TO APRIL 25, 1909.
1st 2nd 3rd Day. 4th Day. 5th Day. 6th 7th Day. 8th Day. 9th 10th 11th Day. 12th 13th 14th Day
Day. Day. Day. Day. Day. Day. Day.
Place of Havre Rouen Chartres Beaugency Amboise Loches Couhé- Bergerac About Biarritz Pamplona Biarritz Pau St. Giron
departure Vérac Biarritz
Place of Rouen Chartres Beaugency Amboise Loches Couhé- Bergerac Biarritz About Pamplona Biarritz Pau St. Carcasson
arrival Vérac Biarritz Girons
Daily 60 71½ 61 58½ 56½ 80 130 160 9 75 82 79 97 82
mileage
Weather Cloudy Rain Much rain Much rain Rain Slight Cloudy, Sun all Sun all Sun all Hot sun Hot Hot Cloudy,
rain sunny day day day and sun, no sun, bright
intervals clouds clouds no
clouds
Expenses 36.20 2.00 — — — — — — 16.00 16.80 3.00 9.50 2.00 —
of running
motor
Petrol 70 — — 60 — — 60 — — 60 — 60 — —
quantity
(litres)
Petrol 31.50 — — 25.00 — — 27.00 — — 30.00 — 27.70 — —
price
Oil 18 — — — — — — — — — 2 — — 2
quantity
(litres)
Oil price 18.75 — — — — — — — — — 2.50 — — 2.50
Non-stop 0 0 0 0 + + 0 + 0 0 0 0 0 0
runs
Stops due — — French Ran out of — — — Magneto — — — — — —
to number- petrol
plate loose
Lamps — — — — — + — spark-
used (+) gap
screw-
head
worn off
Tyres — — — — — — + — — + + — + —
(Dunlops):
Four grooved, one steel studded, one spare grooved, and one on — — — — — — — —
Stepney wheel

15th Day. 16th 17th 18th 19th 20th 21st 22nd 23rd Day. 24th 25th 26th 27
Day. Day. Day. Day. Day. Day. Day. Day. Day. Day. Da
Place of departure Carcassonne Béziers Nîmes Aix-en- Agay Mentone, Mentone St. Tarascon Orange St. Moulins Me
Provence San Raphaël Étienne
Remo,
etc.
Place of arrival Béziers Nîmes Aix-en- Agay Mentone Mentone St. Tarascon Orange St. Moulins Melun L
Provence Raphaël Étienne And
Daily mileage 55 77 105 82 77 44 67 128 33 118 109 150 11

Weather Hot and Hot and Sunny Sunny Sunny Sunny Slightly Very hot Cloudy, Cloudy, Cooler, Cloudy Sun
sunny sunny cooler and bright bright, but fine at times an
sunny shower clo
in night
Expenses of 4.50 — — — — 5.00 12.10 — 11.30 3.00 — 1.50 —
running motor
Petrol quantity 50 — — 50 40 — — 35 — — 60 — 4
(litres)
Petrol price 22.50 — — 25.00 15.20 — — 13.30 — — 25.20 — 15

Oil quantity 2 — 2 — — — 5 — 5 2 2 2 2
(litres)
Oil price 2.50 — 3.00 — — — 7.50 — 7.00 3.00 1.90 2.50 2.

Non-stop runs 0 0 0 — 0 0 — 0 — — — — 0
Stops due to — — — Leaking — — Clutch- — Lubricating- blocked dirty oil —
petrol- ball race tube with
pipe adrift
Lamps used (+) + — + — + — — + — — — — —
Tyres (Dunlops): — Nail- Back — — — — —
puncture grooved
of
studded
tyre
Three grooved, one steel studded, one spare grooved, and one on Stepney wheel
tyre burst, having had a severe glass-cut; front, nail-puncture

A LIST OF IMPORTANT EVENTS IN FRENCH HISTORY, AND OF THE KINGS OF FRANCE AND THE
SOVEREIGNS OF ENGLAND IN PARALLEL COLUMNS

English Sovereigns. French Kings. Prominent Events in French History.

Evacuation of the Romans, 410
Saxon and Anglian invasions,
Merovingian Kings from 481
circa 450-550
Mayors of the Palace, 687-741 Battle of Tours, 732. (Charles Martel defeated the
Carolingians, 741 Charlemagne, 771 Saracens)
Egbert (first overlord 802 of
England),
Alfred the Great (seven other Coming of the Northmen. Rollo, the leader, became first
The later Carolingian Kings from 814
Saxon Kings), 871 Duke of Normandy, 912
Ethelred the Unready, 978 Hugh Capet, 987
Robert the Pious, or Debonair, 996
Edmund Ironside, 1016
Cnut, 1017 Henri I., 1031
Harold Harefoot, 1036
Hardicanute, 1040
Henri I. assists William the Norman to conquer insurgent
Edward the Confessor, 1042
barons at the Battle of Val es dunes
Harold II., 1066 Philippe I., 1060
William I. (the Conqueror), 1066 Conquest of England by William of Normandy, 1066
William II. (Rufus), 1087 First Crusade, 1095
Henry I., 1100 Louis VI., 1108
Stephen, 1135 Louis VII., 1137 Led the Second Crusade, 1147
Henry II., 1154 Philippe II. (Auguste), 1180
Richard I. (Cœur de Lion), 1189 Third Crusade, 1189
John, 1199 Normandy conquered from King John, 1204
Albigensian Crusade, 1204
Notre-Dame built
Henry III., 1216 Louis VIII., 1223
Louis IX. led Crusade to the East, but was captured by the
Louis IX. (known as St. Louis), 1226
Saracens, 1248
Edward I., 1272 Philippe III., 1272
 Philippe IV., 1285
Edward II., 1307 Louis X., 1314
Philippe V., 1316
Charles IV., 1322
Edward III., 1327 Philippe VI. (the first of the Valois), 1328 Hundred Years’ War with England began, 1337
Battle of Crécy, 1346
Jean (le Bon), 1350 Battle of Poitiers, 1356. King John taken prisoner
Charles V., 1364
Richard II., 1377 Charles VI., 1380
Henry IV., 1399
Battle of Agincourt, 1415. Henry V. declared heir to
Henry V., 1413
French Crown
Jeanne d’Arc relieves Orleans, 1429. Crowns the King
Henry VI., 1422 Charles VII., 1422
(1430), is burnt at Rouen, 1431
Edward IV., 1461 Louis XI., 1461
Edward V., 1483 Charles VIII., 1483 Makes war with Italy, 1495
Richard III., 1483
Henry VII., 1485 Louis XII., 1498 Makes war with Italy, 1499
Battle of the Spurs, 1513
Henry VIII., 1509 François I., 1515 Meeting of the Field of the Cloth of Gold, 1520
The Reformation, 1529
Edward VI., 1547 Henri II., 1547
Mary, 1553
Elizabeth, 1558 François II., 1559
Charles IX., 1560 Massacre of St. Bartholomew, 1572
Henri III., 1547 Murder of the Duc de Guise at Blois, 1588
Henri IV. (the first of the Bourbons), 1589 Edict of Nantes, giving toleration to Protestants, 1598
Last meeting of States-General before the Revolution,
James I., 1603 Louis XIII., 1610
1614
Charles I., 1625
Charles II., 1660 Louis XIV., 1643 War with Holland, 1672
James II., 1685 Revocation of Edict of Nantes, 1685
William III. and Mary, 1688
Anne, 1702 War of the Spanish Succession, 1702
George I., 1714 Louis XV., 1715
George II., 1727 War with England, in Canada and in India, 1754
George III., 1760 Seven Years’ War, 1756
Louis XVI., 1774 French Revolution, 1789
Meeting of the States-General, 1789
Trial and death of Louis XVI. and Marie Antoinette, 1793
Directory and Consulate: Napoleon as First Consul, 1799
Napoleon, 1804 Battles of Austerlitz, 1805; Trafalgar, 1805; Jena, 1806
Retreat from Moscow, 1812
Abdication, 1814
George IV., 1820 Louis XVIII., 1814 Napoleon returns from Elba, 1814
The Hundred Days
Battle of Waterloo, 1815
Napoleon sent to St. Helena, 1815
Charles X., 1824 Abdication of Charles X., 1830
William IV., 1830 Louis Philippe, 1830
Victoria, 1837 Napoleon’s remains brought to France, 1840
Abdication of Louis Philippe, 1848
The Second Republic, 1848
Napoleon III., 1852 The Crimean War, 1854
War with Germany, 1870
Abdication of Napoleon III.
The Third Republic, 1870
 INDEX
A, B, C, D, E, F, G, H, I, J, L, M, N, O, P, Q, R, S, T, U, V, W, Y, Z
Abadie, Paul, 154, 156, 159
Abbeville, 2, 22, 23
Abderahman, 135
Acquigny, 48, 49
Adour, River, 179, 180, 181, 184, 220
Agay, 304
Agde, 254
Aigues-Morte, 273, 277
Aigues, River, 341
Aix-en-Provence, 292-297
Alaric, 107
Albigensian war, 258
Alcuin, 125
Alençon, Jean, Duc d’, 130
Aleth, Bishop of, 40
Allaines, 73
Allier, River, 363, 365, 368
Allonnes, 73
Alluye, Baron Florimond d’, 102
Almandoz, Spain, 208
Ambleteuse, 25
Amboise, 82, 105, 107-110
Amfreville, 44
Amfreville-les-Champs, 415
Andance, 351, 353, 354
Andelle, River, 393
Andely, Le Grand, 408-410
” Le Petit, 410-415
Andoain, 215
Anet, 88
Angoulême, 152, 154-156
Anjou, Counts of, 107, 131
Anne de Bretagne, 104, 132
” of France (daughter of Louis XI.), 367
Annonay, 348, 353
Antibes, 306, 309-311
Apricale, 307, 321
Arc, Joan of, 40-43, 76, 79, 85, 142, 369, 385
Arc, River, 297
Arga, River, 213
Arize, River, 249
Arles, 273, 285-289
Arques-la-Bataille, 418
Arques, River, 23
Arras, 348, 353
Artenay, 74
Attila, 76
Aude, River, 257, 260, 262, 266
Auvergne Mountains, 355, 360, 362
Avignon, 329-337, 350
Avre, River, 57
Azay-sur-Indre, 125

Baigts, 219, 221

Balbigny, 360
Balne, Cardinal de la, 53, 130
Barbaira, 255, 261
Barbazan-Debat, 239
Barère, 239
Baring-Gould, the Rev. S., 221, 238
Barry, Madame du, 388
Bartholdi, 277
Basques, the, 180, 181, 196-198, 213
Bayonets, invention of, 186
Bayonne, 176, 180-187, 219
Béarn, Pierre de, 223
Beaucaire, 325, 327, 328
” Canal, 277
Beauce, Jean de, 66
Beaugency, 81, 83-85
Beaulieu, 306, 316
” Abbey of, 141
Beauregard, 81
Beauvais, 418
Beauvronne, River, 160
Bèbre, River, 362
Bedford, John, Duke of, 34
Béhobie, 195, 203-205, 217
Belesme, Robert de, 402
Bellegarde, 283
Benedict XII., Pope, 335
Bergerac, 166-169
” Cyrano de, 168
Bernadotte, King of Sweden, 233, 234
Bernay-en-Ponthieu, 22
Berneval, Alexandre de, 39
Berri, Counts of, 107
Berthier, General, 350
” Madame, 90
Berwick, James FitzJames, Duke of, 368
Bessay, 363
Béziers, 255, 266-269
Biarritz, 176, 187-192
Bidart, 200
Bidassoa, River, 203, 204, 217
Biscay, Bay of, 180
Black Prince, the, 140
Bléré, 114
Bleriot, M., 24
Blois, 81, 93-104
” Stephen, Count of, 103
Blosseville Bonsecours, 416
Bohier, Antoine, 112
” Thomas, 112
Bois d’Enemets, Château de, 408
Boivre, River, 140
Bolbec, River, 9
Bonheur, Rosa, 409
Bonny-sur-Loire, 374
Boos, 416
Bordighera, 307, 321
Bossuet, Jacques, Bishop of Meaux, 394
Bouconvilliers, 397
Boulogne, 21, 26
Bourbon Condé, Duchesse de, 59
” Antoine de, 231
” Dukes of, 367
Bourg-Argental, 348, 354
Bourgogne, Agnes de, 367
Boussière, La, 376
Bouteville, Comte de, 407, 408
” Madame de, 408
Bracieux, 81, 90
Brantôme, 153, 159, 160
Brézé, Louis de, 34, 130
” Pierre de, 35
Briare, 115, 374, 376, 377
Briçonnet, Cardinal, 265
Bridan, 68
Brignoles, 293, 299, 303
Brittany, 40
Broglie, Princesse de, 106
Brougham, Henry, Lord, 304, 308
Bruce, David, 414
Buckingham, Duke of, 202
Burgundy, Marguerite of, 414

Cæsar, Julius, 25, 74, 301

Cagnes, 309
Calais, 23, 24
Calvin, 230
Calvinus, Sextius, 294
Campagne, 176
Camporosso, 320
Cannes, 306-309
Cannet, Le, 309
Canterbury, Archbishop of, 17
Carcassonne, 162, 254-261
Carinus, Emperor, 263
Carmargue, the, 277, 285
Carnutes, tribe of, 75
Carrara marble, 68, 367
Carus, Emperor, 263
Casimere, Marie, 104
Casteljaloux, 168, 171, 172
Castellane, Marquise de, 336, 337
Castile, Blanche of, 393, 403, 405
Cauchon, Bishop, 42
Caudebec-en-Caux, 11-14
Caux, Plateau of, 416
Cénon, 134
Cevennes (mountains), 261, 276, 348, 353
Chabannes, Jacques de, 362
Chalon sur Saône, 346
Chambiges, Pierre, 389
Chambord, Château de, 86-91
Chambourg, 125
Champaigne, Philippe de, 394
Chancelade, 161
Chapelles, Comte de, 407, 408
Charente, River, 149, 151, 154
Charité, La, 373
Charlemagne, 30, 69
Charles V., Emperor of Germany, 108
” the Bad of Navarre, 223, 414
” the Bald, 45, 49
” le Bel, Blanche, wife of, 414
” the Bold, 127
” VII., 16, 35, 128, 132
” VIII., 36, 107, 120, 132
” IX., 39, 88, 182, 204, 224, 231
” Martel, 135
Chars, 397
Chartres, 62-71
Châteaubourg, 347, 352
Chateaubriand, F. R., Vicomte de, 409
Château Gaillard, 277, 403, 411-415
Château l’Évêque, 153, 160, 161
Châteauneuf-sur-Loire, 115
Châtellerault, 117, 134-137
Chatenay, 387
Châtillons, the, 103
Chaumont-en-Vexin, 397, 398
Chaumont-sur-Loire, 81, 105
Chaunay, 149
Chécy, 115
Chenonceaux, 110-114
Cher, River, 111
Cheverny, 91, 92
Choisy-le-Roi, 386, 387
Ciran, 132, 133
Clain, River, 135, 137, 140, 148
Clarendon, Lord, 368
Clement V., Pope, 332
” VI., Pope, 336
” VIII., Pope, 77
Clermont, 249
Clermont-de-Beauregard, 166
Colbert, 6
Coligny, Admiral, 60
Condé, Princes of, 5, 60, 281
Condeau, River, 166
Conflans-St. Honorine, 7, 392
Constantine IV., 136
Conti, Princes of, 5
Cormeilles-en-Vexin, 396
Cormery, 125
Cornas, 351
Corniche d’Or, 294, 303
Corniche, the upper road, 314-316
Cosne, 374
Couhé-Vérac, 149
Coursan, 266
Crau, the, 289, 290
Crécy, 22
Creuse, River, 133
Crusades, the, 56, 277, 405, 406
Crussol, Château of, 348
Cussay, 133

D’Albret, Henri, 230, 232

” Jeanne, 224, 230-233
D’Amboise, Cardinal Georges, 35-37, 106
Dangé, 134
Dangu, Château of, 407, 408
D’Arc, Jeanne, 369, 385
Dax, 179
Dearmer, the Rev. P., 407
Denis-Dupont, 102
Depuis, Charles Fr., 399
Descartes, 133
Devereux, family of, 55
Diane de Poitiers, 35, 106, 112, 114, 131
Dieppe, 21
Dieulafoy, M., 412
Dignac, 156
Dijon, 347
Dolceacqua, 320
Donzère, 342, 343
Dordogne, River, 166, 168, 169
Doux, River, 352
Dreux, 57-60
” de Mello, 128
Dronne, River, 159
Drot, River, 169
Duclair, 18
Du Guesclin, Bertrand, 140, 141
Dunois, the Bastard of Orleans, 83-85, 103
Dupin, Fermier Général, 113
Durance, River, 325
Duval, Nicholas, Seigneur de Viennois, 409

Edward the Confessor, 17

” III., 22, 140
” VII., 184, 189, 191
Elbeuf, 45
Eleanor of Aquitaine, 141
Elizabeth, Queen of Spain, 182-204
Epte, River, 393, 402-404, 407
Estérels, the, 315
Eugénie, Empress, 187
Eure, River, 48, 49
Evreux, 48, 49-55
Eymet, 169
Eze, 314

Faisans, Île des, 203

Fanjeaux, 253
Félibres, the, of Périgord, 157
Feurs, 359, 360
Flassans, 300
Foix, 248
” Gaston Phœbus, Count of, 174
” Louis de, 181
Fontainebleau, 380
” Forest of, 380
” Palace of, 381
Fontenay, 378
Fontenelle, 14
Forges-les-Eaux, 418
Fouillouse, La, 359
François I., 88, 89, 93, 104, 107, 112, 130, 132, 181, 381, 389, 409
” II., 109, 113
Fréjus, 301, 302
Frenaye, La, 11
Freycinet, 344
Froissart, 222
Fuentarrabia, 217
Fulbert, Bishop, 64

Gabriel, 77, 102

Gamaches, Plains of, 413
Garonne, River, 171, 240-244
Gaston Phœbus, Count of Foix, 222, 223, 230, 232
German troops in France, 14, 76, 120
Gers, River, 239
Gien, 115
Gigean, 255
Gisors, 47, 396, 397, 399, 402-407
Goujon, Jean, 40, 46
Gournay-en-Bray, 418
Graham, General Sir T., 216
Grappin, Robert, 405
Grasse, 309
Graville, 6, 7, 392
Grégoire, M., 39
Grisnez, Cape, 25
Guillaume le Tellier, 13
Guillon le Roy, 4
Guise, Cardinal de, 96
” François, Duc de, 59
” Henri, Duc de, 45, 66-100, 104

Harfleur, 4, 7-9
Harquency, 408
Havre, 3-6, 8
Headlam, Cecil, 64
Henri II., 35, 39, 88, 112, 113, 114, 381, 389, 406
” III., 39, 96, 344, 380
” IV., 6, 13, 39, 45, 46, 54, 60, 76, 77, 100, 120, 231, 381, 411, 418
Henry Plantagenet, 34
” I., 53, 55, 56
” II., 114, 120, 141
” V., 7, 14, 384
” IV., of Castile, 204
Hérault, River, 270
Hers, River, 252
Heuqueville, 415
Hilduard, 69
Hill, Sir Rowland, 182
Holy Land, the, 17, 277, 405, 406
Hope, Sir John, 182-184, 191
Houeillès, 168, 172
Hugo, Victor, 409
Huguenots, the, 6, 29, 76, 84, 120, 163, 168, 202, 222, 224, 238, 243, 341, 380
Hugues IV., 156
Hundred Years’ War, 48, 171
Huns, the, 76
Hurault de Cheverny, Philippe, 92

Ibos, 237
Igoville, 45
Indre, River, 125
Innocent VI., Pope, 332, 336
Irene, Empress, 69
Irun, 217
Irurita, 207
Isère, River, 352
Isle, River, 160, 161, 165
Isolabona, 321
Iton, River, 49, 51, 54
Ivry, Battle of, 54, 58, 60

James II., 25
” Colonel W. H., 185-186
Jean de Berry, 147
” of France, 415
Jeanne D’Arc, 40-43, 76, 79, 369, 385
John, King of England, 55, 128, 141, 413
John XXII., Pope, 333
Jumièges, 15-18, 132

La Beauce, Plain of, 72

La Belle Rivière, 157
La Borde, 265
La Boussière, 376
La Charité, 373
La Fouillouse, 359
La Haye-Descartes, 133
La Houssoye, 418
La Mortola, 319
La Napoule, 294, 304
La Pacaudière, 361
La Palisse, 362
La Rochebeaucourt, 156
La Tricherie, 137
La Turbie, 315
La Vacherie, 415
Lacave, 245
Lacy, Roger de, 413
Laffolye, M., 243
Lambesc, 325
Lamonzie-Montastruc, 153
Landes, Les, 176-180
Lannemezan, 239-240
Lapalud, 342
Lascarte, 215
Laville, the Jesuit, 165
Le Boullay-Mivoye, 61
Le Cannet, 309
Le Loup, 309
Le Luc, 300
Le Muy, 300
Le Roulx, 20, 43
Le Veneur, Bishop Ambroise, 54
“ ” Gabriel, 54
Les Grandes Ventes, 418
Les Thilliers-en-Vexin, 408
Legasa, 207
Lemercier, Jacques, 395
” Pierre, 395
Leo III., Pope, 136
Leonardo da Vinci, 108
Lérins, Îles de, 311
Lescure, 248
Lèze, River, 250
Lézignan, 262
Lhez, 239
L’Hôpital, 360
Lierville, 397
Lieusaint, 386
Ligueil, 132, 133
Lillebonne, 9-11
Lisieux, 12
Livron, 344
Loches, 16, 127-132
Loing, River, 377, 379, 380
Loire, River, 82, 93, 105, 360
Longboël, Forest of, 416
Longueville, Duke of, 5, 86
Loriol, 344
Louis VII., 120
” IX. (St.), 277, 389, 393, 394, 403
” XI., 106, 107, 110, 128, 130, 132, 204, 404
” XII., 36, 46-48, 93, 100, 103, 104, 107, 132
” XIII., 39, 88, 177, 368, 397, 407, 408
” XIV., 88, 200, 204, 388, 394
” XV., 386, 387, 388, 394
” XVI., 132, 387, 388
” le Gros, 83
” le Jeune, 381
” Philippe, 39, 58, 59, 380
Lourdes, 234-237, 372
Louviers, 28
” Treaty of, 402, 411
Lunel, 276
Lyon, 346

Macon, 346
Macquoid, Mrs., 13
Maeterlinck, Maurice, 14
Maintenon, Marie de, 388
Malaunay, 21
Mane, 245
Mansard, François, 100, 104
Mansle, 150
Mareuil-sur-Belle, 157
” Arnant de, 157
Marguerite de Valois, 100, 156, 230
Marie Antoinette, 387
Marie Casimire, 104
Marie-Thérèse, Infanta of Spain, 200
Marines, 396
Marius, 295, 297
Marmande, 170, 171
Maromme, 2
Marot, Clément, 230
Marquise, 2
Marsillargues, 277
Martin, Cap, 315, 317
Marville-Moutier-Brulé, 60
Mary, Queen of Scots, 109, 113
Mas d’Azil, 249, 250
Massieu, Maître Jean, 42
Matilda, Empress, 39
Maure Mountains, 300
Maurice, Archbishop of Rouen, 34
Maurilius, Archbishop, 31
Mayenne, 60, 418
Mazarin, Cardinal, 5
Medici, Catherine de, 88, 96, 104, 106, 109, 113, 182, 204
” Marie de, 394
Mediterranean Sea, 270
Melun, 382, 384, 386
Menay, 250
Mentone, 317-319
Mercœur, Françoise de Lorraine, Duchesse de, 113
Merdanzo, River, 321
Mesves, 374
Meung-sur-Loire, 81, 83
Meylieu-Montrond, 359
Mèze, 271
Midi, Canal de, 269
Midouze, River, 177
Mirabeau, statue of, 377
Miramont, 170
Mirepoix, 252
Mistletoe, 105, 378
Mistral, family of, 350
Molière, Jean B. P., 270
Monaco, 306, 316, 317
Monsec, 159
Mont-de-Marsan, 171, 173, 176
Mont Pilat, 355
Montagnac, 270
Montagne, Étienne de, 120
Montargis, 377
Montastruc, 166
Montbard, 347
Montdragon, 341
Monte Carlo, 317
Montélimar, 343, 344
Montfort, Simon de, 258, 260, 268
Montgéron, 386
Montgomery, Gabriel, Comte de, 113, 173, 222, 224, 231, 238
Montlhéry, Battle of, 35
Montmorenci, Henri, Duc de, 59, 60, 368
Montpellier, 274-276
Montréal, 253
” Château de, 220
Montrejeau, 240
Montreuil-sur-Mer, 2, 21
Morin, Pierre, 110
Mormant, 376
Mornas, 341
Mortola, La, 319
Mosnier, Jean, 92
Moulins, 365-368
Moux, 261
Myennes, 374

Naintré, 134
Nampont St. Martin, 22
Napoleon I., Emperor, 302, 350, 381, 382
” Prince Louis, 26
” III., 189
Napoule, La, 304
Narbonne, 262-266
Narvate, 207
Neaufles, Château de, 402, 403, 407
Nemours, 379, 380
” Duc de, 380
Nepveu, Pierre, 88
Neufchâtel-en-Bray, 23
Neulise, 360
Nevers, 369-372
” Counts of, 371
Nice, 310-314
Nicholas, Abbot, 39
Nîmes, 278-283
Nivelle, River, 200, 201, 202
Nogent-sur-Vernisson, 376
Nonancourt, 50, 56
Norsemen, the, 4, 15, 17, 29, 30, 38, 118
Nouan sur-Loire, 86
Numerian, Emperor, 263

Oise, River, 392, 393

Ondres, 180
Orange, 337, 340
Orb, River, 267, 269
Orgon, 328
Oriflamme, banner of the, 393
Orleans, 74-79, 83
” Charles d’, 103
” Duc d’, 109
” Duchesse d’, 58, 59
” Gaston d’, 94, 104
” Louis d’, 103
Orthez, 222-225
Ospedaletti, 322
Ouzouer-sur-Loire, 115

Pacaudière, La, 361

Pactius, Prior Thomas, 131
Pailhès, 250
Palisse, La, 362
Pamiers, 251
Pamplona, 210-213, 223
Paris, distant view of, 392
Pascal II., Pope, 373
Patay, Bishop Gilles de, 77
Pau, 227-234
” Gave de, 221, 222, 226, 228
Pavia, Battle of, 362
Pelisanne, 291
Périgueux, 160, 161-165
Petrarch, 332
Peyrehorade, 220
Pézenas, 270
Philibert of Châlons, 340
Philip III. of Spain, 392
” IV. of Spain, 392
Philippe I., 392
” Auguste, 53, 55, 56, 128, 141, 393, 402, 406, 413, 414
” de Savoie, 130
” de Valois, 76
” le Hardi, 277
Phocæan Greeks, 286
Phœnicians, the, 287, 290
Pierre-Trouée (Cromlech), 398
Pierrelatte, 342
Pilat, Mont, 355
Pinas, 240
Piolenc, 341
Pius VI., Pope, 349
“ VII., Pope, 374
“ IX., Pope, 237
Plaine du Forez, 359
Plessis-les-Tours, 107
Pliny, 270
Poitiers, 139-148
“ Anne de, 389
“ Battle of, 415
Poland, Stanislas Leczinska, King of, 90, 104
Pommeréval, 418
Pompogne, 172
Pontacq, 234
Pont de l’Arche, 45, 46
Pontoise, 392-396
Pontoux, 178
Pougues-les-Eaux, 372-373
Pouilly, 374
Poulain, Nicholas, 404
Pourrières, 293, 297
Poussin, Nicholas, 410
Provence, Marguerite de, 393
Puy, Le, 353
Puyôo, 221
Pyrenees, the, 177, 180, 228, 234, 239, 251, 253

Quirinus, 63

Ratuma, 28
Reignac, 125
René, King of Provence, 295, 296, 328
” of Nassau-Dillenburg, Count, 340
Rey, General, 216
Rhé, Île de, 202
Rhone, River, 285, 332, 341, 348, 352-355
Richard I., 17, 34, 39, 55, 56, 128, 403, 411, 412
Richelieu, Cardinal, 6, 408
Riquet, Pierre-Paul, 268
Roanne, 360
Robert de Croixmare, Archbishop of Rouen, 36
Robert, Archbishop of Rouen (1037), tomb of, 69
” of Jumièges, Abbot, 17
Rollo, 4, 29, 30, 33, 34
Romans, the, 161, 262, 279, 280, 281, 286, 287, 307
Roquebrune, 315
Roquemaure, 337
Rouen, 28-44
Roussel, Abbot Jean, 39
Ruffec, 139, 149, 150
” Ph. de Voivre, Marquis de, 155

Sabarat, 250
St. Aignan, 77
St. André, 56, 60
St. Armand de Rouen, Abbesses of, 416
St. Arnoult, 11
St. Austreberthe, Abbey of, 21
St. Bartholomew, Massacre of, 40, 182, 224
St. Blaise, 124
St. Cannat, 291, 324, 325
St. Crespin, 45
St. Cyr, 348, 353
St. Étienne, 355-357
St. Euverte, 77
St. Front, 162
St. Gaudens, 242-244
St. Gautier, Abbé of Meulan, 396
St. Georges-de-Boscherville, 19
St. Géours-de-Marenne, 179
St. Germain-en-Laye, 388
St. Germain-en-Laye, Château de, 389
St. Gilles, 283
St. Girons, 247, 248
St. Hilaire, 141
St. Honorat, Île de, 311
St. Honorine, 6, 7
St. Ignatius de Loyola, 212
St. Jean de Luz, 186, 194, 200-202
St. Justin, 173
St. Laurent-des-Eaux, 85
St. Laurent-l’Aigouze, 277
St. Liphard, 83
St. Lizier, 246, 247
St. Maclou, 40
St. Marguerite, Île de, 311
St. Martin Boscherville, 19, 20
” Omonville, 23
” of Tours, 107, 118, 121
St. Martory, 244, 245
St. Maximin, 298
St. Mellon, 28, 29
St. Nicholas-de-Pont-St. Pierre, 415
St. Ours, 127
St. Pé-de-Bigorre, 227
St. Péray, 350
St. Philibert, 17, 18
St. Pierre-le-Moutier, 369
St. Raphaël, 302, 303
St. Rémy, 325, 326
St. Romain, Archbishop of Rouen, 29
St. Romain de Colbosc, 9
St. Sebastian, 263
St. Sennoch, Château de, 133
St. Vallier, 353
” Conte de, 131
St. Victoire, Mont, 293, 297
St. Victrice, 29, 30
St. Vincent-de-Tyrosse, 180
St. Wandrille, 9, 13-15, 17
St. Wulmer, Abbey of, 21
Salat, River, 245
Salon, 290-291
Samer, 21
San Ampeglio, Capo, 322
San Remo, 307, 322
San Sebastian, 215-217
Sangatte, 24
Sanqueville, 21
Sant’ Esteban, 207
Saracens, the, 135, 141
Sarras, 353
Saulce, 340
Saxe, Marshal M. de, 89
Scott, Sir Walter, 409
Seine, River, 4, 7, 11, 14, 18, 19, 28, 44, 288, 291, 292, 293
Selby Abbey, 32
Sénas, 325
Sens, 347
Seyches, 171
Sforza, Ludovic, Duke of Milan, 130
Sichel, E., 97, 232
Sillory, Chancellor, 396
Smollett, Tobias, 313
Sologne, the, 88, 91
Sorel, Agnes, 16, 128, 132
Soubirous, Bernadette, 235-237, 372
Soult, Marshal, 182, 217, 221, 224
Soumoulou, 234
Souppes, 379
Southampton, 4
Stopford, Major-General, 184
Strabo, 290
Syrian castles, 277-412

Tancarville, Raoul de, 19

Tarascon, 327, 328
Tarbes, 234, 237-239
Tartas, 176
Terry, Mr. (of Chenonceaux), 114
Texier, Jean, 65
Thau, Etang-de-, 270
Théoule, 304
Thibaut le Tricheur, 103
Thierry, Bishop, 65
Thomer, 56
Tiberius, Emperor, 338
Tolosa, 239
Tonnere, 347
Torcy-le-Grand, 418
Tôtes, 2
Tournay, 239
Tournon, 351, 352
Tourriers, 159
Tours, 110-127
” Battle of, 135, 136, 141
Tourves, 299
Touvre, River, 151
Trencavel, Vicomtes de, 257, 258
Trianons, Les, 388
Trie-Château, 398
Truyes, 125
Turks, the, 313
Tyre, Archbishop of, 406
Urban II., Pope, 348
” V., Pope, 332
Urrugne, 203

Valence, 348-350
Valescure, 302
Varennes-sur-Allier, 363
Varin, Quentin, 410
Vauban, 6
Velate, Col de, 195, 208, 209
Veliocassians, the, 28
Vence, 309
Vendranges, 360
Ventimiglia, 319, 320
Vera, 217
Versailles, 387
Veuves, 107
Vexin, old province of, 392, 393
Vibraye, Marquis de, 92
Victoria, Queen, 187
Vienne, 346
” River, 134, 135
Vigorce, Simon, Archbishop of Narbonne, 260
Villava, 210
Villefranche, 315
Villeneuve-les-Avignon, 336
Villeneuve, St. Georges, 386
Viollet-le-Duc, 258, 265, 367, 409
Visigoths, the, 118, 243, 257, 259
Vivarais Mountains, 348
Vivonne, 139, 148
Vonne, River, 148

Webster, Dr., 197

Wellington, Duke of, 181, 182, 201, 213, 224, 225
William Longsword, 17, 33
” the Norman, 31
” II. (Rufus), 402
” I., Stadtholder, 340
” III., Prince of Orange, 340
Wimereux Harbour, 25, 26
Winchester Cathedral, 20

Yainville, 18
Ymonville, 73
Young, Arthur, 244, 269

Zurbaran, Francisco, 392

 BILLING AND SONS, LTD., PRINTERS, GUILDFORD

The oft-recurring question, ‘What’s wrong?’ will be more easily answered

in future if this volume is by one’s side

BLACK’S
MEDICAL
DICTIONARY
BY
 JOHN D. COMRIE, M.A., B.Sc., M.B., F.R.C.P.E.

Fourth Edition. Large crown 8vo., cloth. Containing 6 full-

page illustrations
in colour in addition to black and white illustrations
in the text

PRICE 7/6 NET

(Post free, price 8/-)

SOME PRESS OPINIONS

‘No one could read it through without acquiring a large amount of sound
information, not only in regard to the organs of the human body, their
functions and the diseases to which they are liable, but also a good deal of
learning in regard to such important matters as clothing, diet, exercise,
sanitation, and ventilation. It is a thoroughly practical, useful book,
singularly complete, which should be welcome in many households.’—
Scotsman.
‘This is a book which would prove useful from time to time in any
household, and is moreover so well written—its prime merit that of
clearness as to furnish reading of an interesting character quite apart from
the idea of turning the information to immediate use.’—Guardian.
‘Medical terms are arranged and explained in alphabetical order, and the
details given are so practical and clearly put that it is a book we would
strongly recommend to nurses. By having this book in the house the nurse
need not be obliged to write to busy journals on simple medical matters, but
in addition to finding the answer to occasional queries, we can confidently
say that nurses will find this an admirable text-book for occasional study....
This book is the best seven-and-sixpence worth for a nurse that we have
seen for some time past.’—Nursing Times.
‘It would be difficult to think of anything in medical terminology that is
not indexed and sufficiently explained in this very compact, well-printed,
and up-to-date volume of 850 pages. The descriptions are marvellously
clear and detailed.... The illustrations are well selected and clearly printed.
The Dictionary is altogether admirable, and will prove itself useful alike to
the junior student, the nurse, the ship-captain, or such as cannot command
expert attention in time of sickness or accident.’—Glasgow Herald.
‘The fact that this Medical Dictionary comes from a firm so well known
as the publishers of “Who’s Who,” and is uniform with that reliable and
valuable work of reference, will be some guarantee of the genuine character
of “Black’s Medical Dictionary.”... We regard it as a practical and valuable
work.’—Sheffield Daily Independent.
Detailed prospectus containing specimen pages on application to the
publishers.
Published by
ADAM AND CHARLES BLACK, SOHO SQUARE, LONDON. W.

BLACK’S ANNUALS AND

BOOKS OF REFERENCE

WHO’S WHO
AN ANNUAL BIOGRAPHICAL
DICTIONARY

Crown 8vo., cloth

Price 10s. net
or in full red leather, with rounded
corners and gilt edges
Price 12s. 6d. net
This year’s issue contains about 23,000 biographies.
‘That Peerage of the intellect.’—Illustrated London
News.
‘The Peerage of achievement.’—The Onlooker.
 Crown 8vo., limp
cloth
Price 1s. net
WHO’S WHO Important and
useful tables,
YEAR-BOOK formerly
incorporated in
‘Who’s Who.’

Edited
by G. E.
Mitton
ENGLISHWOMAN’S Crown
8vo.,
YEAR-BOOK AND cloth
DIRECTORY Price 2s.
6d. net
‘It
contains
a marvellous amount of valuable information relative
to women’s professions, trades, employments, sports,
pastimes, fads, philanthropies—everything that even
the most versatile of modern women may wish to look
up.’—The Lady.

THE WRITERS’ AND

ARTISTS’ YEAR-BOOK
A DIRECTORY FOR WRITERS,
ARTISTS,
AND PHOTOGRAPHERS

Crown 8vo., limp cloth

Price 1s. net
‘This is a useful book for the writer and artist, and not
less for the literary tyro, who wants to know the most
 likely quarter in which to get his work accepted. It
gives a list of journals and magazines, with
information as to the nature of the “copy” they may be
expected to prefer, and, as far as possible, the rates of
payment in each case.’—Bristol Daily Mercury.

THE
SOCIAL CALENDAR
A DICTIONARY OF THE
SOCIAL FUNCTIONS OF THE YEAR

Crown 8vo., cloth, gilt edges

and rounded corners
Price 2s. 6d. net
or in full leather, gilt edges
and rounded corners
Price 3s. 6d. net
‘Deals, in alphabetical order, with every social
function of note in the United Kingdom, supplying
information as to date of each function, how to obtain
admission, how to dress, etc., etc., and giving those
hundred and one little hints as to practical details
which most people must at some time or other require
to know.’—Lady’s Pictorial.

Crown 8vo., limp cloth

Price 1s. net
‘This Year-Book ... should become indispensable
wherever Billiards is played. It provides a record of all
the principal matches of the past season, gives full
information concerning the game and its
developments, and also contains many interesting
articles dealing with various points of the game. It is
published with the authority of the Billiard
Association.’—Oxford Magazine.
 IF
O
THE BILLIARD R
YEAR-BOOK D
E
R
OFFICIALLY APPROVED BY THE
E
BILLIARD ASSOCIATION D
T
H
R
OUGH THE POST, STAMPS SHOULD BE ADDED
AS FOLLOWS: FOR ‘WHO’S WHO,’ 6d.;
‘ENGLISH YEAR-BOOK,’ 4d.; OTHER BOOKS, 3d.
EACH
These books may be obtained from any bookseller, but
the publishers will be pleased to send a prospectus of
either of them on application.
ADAM AND CHARLES BLACK, 4 SOHO
SQUARE, LONDON, W.

FOOTNOTES:
[A] Although its appearance might suggest otherwise, the writer and four others
(including ladies) were given an excellent dinner, clean rooms, and every possible
attention at this little hotel. The car was put into a lofty barn at the end of the
courtyard.
[B] Contemporary Review, September, 1909.
[C] April, 1909.
[D] These towers do not appear to be disused windmills, but, having omitted to
make inquiries locally, the writer is unable to describe their uses. None of the French
topographical writers on this part of France appear to consider them worthy of
comment.
[E] They were an invention of Sir William Congreve in 1803.
[F] Fiona Macleod.
[G] Eagles are not uncommon in the Pyrenees. The writer noticed a large bird in
the Pass of Velate which he took to be an eagle, but owing to the failing light it was
impossible to be certain.
 [H] Joanne gives the date 1765, but it is incorrect.
[I] The people in the neighbourhood of Albi were known as the Albigenses. They
were of superior intelligence and education, and denounced the vices of the
priesthood, the sacrifice of the Mass, Purgatory, and image-worship, and were
therefore regarded as heretics.
[J] This is mentioned by Hare and Baedeker, but the writer has not seen it.
[K] The author would refer the reader to his volume ‘Along the Rivieras of France
and Italy’ (Dent).
[L] 20 fr. Motor Union, 25 fr. Royal Automobile Club.
 *** END OF THE PROJECT GUTENBERG EBOOK THE MOTOR
ROUTES OF FRANCE ***

Updated editions will replace the previous one—the old editions will
be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright in
these works, so the Foundation (and you!) can copy and distribute it
in the United States without permission and without paying
copyright royalties. Special rules, set forth in the General Terms of
Use part of this license, apply to copying and distributing Project
Gutenberg™ electronic works to protect the PROJECT GUTENBERG™
concept and trademark. Project Gutenberg is a registered trademark,
and may not be used if you charge for an eBook, except by following
the terms of the trademark license, including paying royalties for use
of the Project Gutenberg trademark. If you do not charge anything
for copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such as
creation of derivative works, reports, performances and research.
Project Gutenberg eBooks may be modified and printed and given
away—you may do practically ANYTHING in the United States with
eBooks not protected by U.S. copyright law. Redistribution is subject
to the trademark license, especially commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund
from the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law
in the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name associated
with the work. You can easily comply with the terms of this
agreement by keeping this work in the same format with its attached
full Project Gutenberg™ License when you share it without charge
with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the
terms of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.

1.E. Unless you have removed all references to Project Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears,
or with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
 This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning
of this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.

1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

ebooknice.com