This article explains the use of the idea of connectedness in networks, in two different ways, to bring into focus the basics of the game of Go, namely capture and territory.
The game of go has a simple mechanism. This discussion of the principle of two eyes in go has shown that the game does not depend on equally clear-cut concepts.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
An account of how mathematics is used in computer games including geometry, vectors, transformations, 3D graphics, graph theory and simulations.
Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the relationship between Euler's formula and angle deficiency of polyhedra.
