[SYMBOL][A][B][C][D][E][F][G][H][I][J][K][L][M][N][O][P][Q][R][S][T][U][V][W][X][Y][Z]
@abstractmethods annotation
@dataclass decorator
@functools.lru_cache() function
@lru_cache() decorator
^ operator
A* searches
algorithm for
heuristics
Euclidean distance
Manhattan distance
priority queues
acg Codon
activation functions, 2nd, 3rd, 4th
acyclic trees, 2nd
add_edge() function
adjacency lists
admissible heuristics, 2nd, 3rd
adversarial search
basic board game components
Connect Four
alpha-beta pruning
code for
developing AI for
iterative deepening
minimax algorithm, 2nd
quiescence search
real-world applications for
tic-tac-toe
developing AI for
managing states
minimax algorithm
AI (artificial intelligence), resources for
algorithms, resources for
alphabeta() function, 2nd
artificial general intelligence
artificial neural networks
backpropagation
layers
neurons
overview
astar() function, 2nd
Australian map-coloring problem
auto-memoization, 2nd
backpropagation, 2nd, 3rd, 4th
backtracking, 2nd
backtracking_search() function, 2nd
base cases
Basic Linear Algebra Subprograms (BLAS)
BFS (breadth-first searches), 2nd
algorithm for
queues
bfs() function, 2nd, 3rd, 4th
binary search
binary_contains() function, 2nd
bit array
bit string, 2nd, 3rd, 4th
bit vector
bit_length() function
BitString class
BLAS (Basic Linear Algebra Subprograms)
Board class, 2nd
breadth-first search.
See BFS.
brute-force searches
C4Board class
C4Piece class
calculatePi() function
Callable function
Cell enum
centroid, 2nd
character encoding
choices() function
Chromosome class, 2nd, 3rd, 4th
chromosomes
circuit board layouts
classic computer science problems, defined
classification problems
classifying wine
iris data set
normalizing data
Cluster class
clustering, 2nd
by age
by longitude.
See also k-means clustering.
Codon type
codons, 2nd
colons
Column class
comma-separated values (CSV), 2nd
Comparable class
_compress() function
compress() function
CompressedGene class, 2nd, 3rd
compression, 2nd
optimizing list compression
real-world applications of
trivial
Connect Four
alpha-beta pruning
code for
developing AI for
connected graphs
connected property
consistent() function
Constraint class, 2nd
constraint propagation
constraints, 2nd
constraint-satisfaction problems.
See CSPs (constraint-satisfaction problems).
costs of building networks, minimizing
finding minimum spanning tree
calculating total weight of weighted paths
Jarník’s algorithm
priority queues
working with weights
crossover, 2nd
crossover operator
crossover() function, 2nd, 3rd
cryptarithmetic puzzles, 2nd
CSP class
CSPs (constraint-satisfaction problems)
Australian map-coloring problem
building frameworks for
circuit board layouts
cryptarithmetic puzzles
eight queens problem
real-world applications of
word searches
CSV (comma-separated values), 2nd
csv module
csv.reader() function
cycles, 2nd
data
large data sets
normalizing
resources for data structures
DataPoint interface, 2nd, 3rd
decompress() function
decompression, 2nd
decrypting
deep learning, 2nd
deltas, 2nd
DFS (depth-first searches)
algorithm for
stacks
dfs() function, 2nd, 3rd
Dijkstra’s algorithm, 2nd, 3rd
dijkstra() function, 2nd
DijkstraNode
_dimension_slice() function
directed graphs (digraphs), 2nd, 3rd
display_solution() function
distance() function, 2nd
DNA search problem
binary search
example of
linear search
storing DNA
domain() function
domains, 2nd, 3rd
dot products
dynamic programming
defined
knapsack problem
real-world applications for
Edge class, 2nd
Edge protocol, implementing
edges
eight queens problem
encrypt() function
encryption
decryption and
getting data in order
real-world applications of
endianness
Euclidean distance, 2nd
euclidean_distance() function
feature scaling
feed-forward artificial neural network, 6th.
See artificial neural networks.
defined, 2nd
first layer of
last layer of
fib() function
fib1() function, 2nd
fib2() function, 2nd
fib3() function
fib4() function
fib5() function
fib6() function
Fibonacci sequence
first recursive attempt
generating with generator
iterative approach to
memoization
utilizing base cases
FIFO (First-In-First-Out), 2nd
find_best_move() function, 2nd
fitness function
fitness proportionate selection
float type
floating-point numbers, 2nd, 3rd, 4th, 5th
fMRI (functional magnetic resonance imaging)
frameworks
for constraint-satisfaction problems
for graphs
Edge protocol
Graph protocol
functional programming, resources for
gat Codon
Gene type
generate_domain() function
generations
genetic algorithms
biological background for
challenges for
cryptarithmetic puzzles
generic genetic algorithm
naive test
optimizing list compression
real-world applications of
genetic programming, 2nd
GeneticAlgorithm class, 2nd, 3rd, 4th, 5th
gradient descent, 2nd
gradually typed language
Graph class, 2nd, 3rd
graph problems
building graph frameworks
Edge protocol
Graph protocol
finding shortest paths
breadth-first search
in weighted graphs
maps as graphs
minimizing costs of building networks
finding minimum spanning tree
working with weights
real-world applications of
Graph protocol, implementing
graphics
graphs
greedy algorithm, 2nd, 3rd
GridLocation
hanoi() function
heappop() function
heappush() function
heapq module
heuristic() function
heuristics, 2nd
Euclidean distance
Manhattan distance
hidden layers, 2nd
Hyperloop network, 2nd, 3rd, 4th, 5th, 6th
if statement, 2nd
import statement, 2nd
infinite loops
infinite recursion, 2nd
__init__() function
input layers, 2nd
int type, 2nd, 3rd
int.from_bytes() function
integer-division (//)
IntEnum type
interpret_output() function
iris data set
iris_classifications
iris_interpret_output() function, 2nd
iterative deepening
itertools module, 2nd
KMeans class, 2nd, 3rd, 4th
k-means clustering
album example
algorithm for
clustering by age and longitude
extensions
preliminaries of
problems with
real-world applications of
knapsack problem
Last-In-First-Out (LIFO), 2nd, 3rd
Layer class, 2nd
layers, 2nd
layer_structure argument
learning rate, 2nd, 3rd, 4th, 5th
LIFO (Last-In-First-Out), 2nd, 3rd
linear search
linear_contains() function, 2nd
local_assignment dictionary
machine learning
Manhattan distance
map() function
MapColoringConstraint class
maps, as graphs
matplotlib library
max_depth function
Maze class, 2nd
maze problems
A* search
algorithm for
heuristics
priority queues
breadth-first search
algorithm for
queues
depth-first search
algorithm for
stacks
generating random mazes
maze minutiae
MazeLocation, 2nd
MCState class, 2nd
mean() function
memoization, 2nd, 3rd
automatic
real-world applications of
metropolitan statistical areas (MSAs)
min() function
minimax algorithm
improving
with alpha-beta pruning
with iterative deepening
with quiescence search
testing
minimax() function, 2nd, 3rd
minimum spanning trees.
See spanning trees, finding minimum.
missionaries and cannibals problem
representation of problem
solving
mnemonics for phone numbers
MSAs (metropolitan statistical areas)
mst() function
mutate() function, 2nd, 3rd
mutation operator
my_gene function
mypy project
NamedTuple class
neighbors_for_index() function
Network class
networks
building
implementing layers
implementing neurons
implementing
minimizing costs of building
finding minimum spanning tree
working with weights
neural networks, 2nd
artificial
backpropagation
layers
neurons
overview
biological basis of
building networks
implementing layers
implementing networks
implementing neurons
classification problems
classifying wine
iris data set
normalizing data
defined
extensions
preliminaries for
activation functions
dot products
problems with
real-world applications of
speeding up
Neuron class, 2nd
neurons, 2nd, 3rd
nlargest() function
Node class, 2nd
node_to_path() function
normalization, 2nd
normalize_by_feature_ scaling() function
normalizing data
NP-hard (non-deterministic polynomial hard) problem, 2nd
nucleotides, 2nd, 3rd
NumPy
open source projects, resources for
open() function
Optional type
output layers, 2nd
pandas
parse_CSV() function
partial() function
paths
defined
finding shortest
finding shortest in weighted graphs
Dijkstra’s algorithm
weighted
permutation generation
phone number mnemonics
real-world applications for
Traveling Salesman Problem
permutations() function, 2nd
phone number mnemonics
pi, calculating
_pick_tournament() function
Piece class, 2nd
pip install typing_extensions
pip3 install typing_extensions
ply, 2nd
pop operation
pop() function
population
powerset
Prim’s algorithm
print() function
print_weighted_path() function
priority queues, 2nd, 3rd
PriorityQueue class, 2nd
product() function
Protocol type, 2nd
pseudocode
pstdev() function
push operation
push() function
python filename.py file
Python IDE PyCharm
Python programming language
resources for
source code repository
versioning
python3 filename.py file
QueensConstraint class
Queue class
queues, 2nd, 3rd
quiescence search
random module, 2nd
random_instance() function, 2nd
random_key() function
recursive functions, 2nd
reduce() function
repeat() function
__repr__() function
_reproduce_and_replace() function, 2nd
roulette-wheel selection
run() function, 2nd
satisfied() function, 2nd
scikit-learn
search problems
DNA search
binary search
example of
linear search
storing DNA
maze problems
A* search
breadth-first search
depth-first search
generating random mazes
maze minutiae
missionaries and cannibals problem
representation of problem
solving
real-world applications of.
See also adversarial search.
secrets package
seeding
selection operator
SelectionType enum
SEND+MORE=MONEY puzzle, 2nd
shuffle() function
sigmoid functions, 2nd
SIMD (single instruction, multiple data), 2nd
SimpleEquation, 2nd
spanning trees, finding minimum
calculating total weight of weighted paths
Jarník’s algorithm
priority queues
Stack class, 2nd, 3rd
stacks, 2nd
standard score
states, managing
statistics module
stdev() function
stochastic operations
stringToGene() function
strong AI
successors() function
sum() function, 2nd
supervised learning, 2nd
switch statement
synapses, 2nd
sys.getsizeof() function
table variable
TensorFlow
testing genetic algorithms
tic-tac-toe
developing AI for
managing states
minimax algorithm
token_bytes() function
total_weight() function
tournament selection, 2nd, 3rd
Towers of Hanoi
modeling the towers
solving
training, 2nd
Traveling Salesman Problem
naive approach to
brute-force searches
permutation generation
sample data
real-world applications for
with large data sets
TTTBoard class, 2nd
TTTPiece class, 2nd
type hints, 2nd
downsides of using
examples of
overview
resources for
usefulness of
type() function
typing import Protocol
typing module
typing package
typing_extensions module, 2nd, 3rd
unbreakable encryption
decrypting
encrypting
getting data in order
undirected graphs, 2nd
unsupervised learning, 2nd
unsupervised methods
unweighted graph, 2nd
user interface code
validate() function
variables, 2nd
vector instructions
vertex matrix
vertices, 2nd
_vertices array
_vertices list, 2nd
visit() function
weighted graph, 2nd, 3rd, 4th, 5th, 6th
WeightedEdge class
WeightedEdges class
WeightedGraph class, 2nd
WeightedPath class
weights
finding shortest paths in weighted graphs
Dijkstra’s algorithm
of weighted paths, calculating total
working with
wine_interpret_output() function
word searches
WordSearchConstraint class, 2nd
XOR (exclusive or) operation, 2nd
zip() function, 2nd
zlib module
z-score, 2nd
_zscore_normalize() function
zscores() function, 2nd, 3rd