This is a direct follow on from 'Modelling games with Graph Theory' where we will explore one of the interesting ramifications of the theory described in that article. The following proof explore the fundamental limitations of game design and will hopefully be both intrinsically interesting and useful for guiding game design. Solvability of Deterministic Full… Continue reading Implication for Deterministic Systems

# Author: computationalgamedesign

## Modelling Games using Graph Theory

This is a follow on piece from the 'Modelling Puzzles using Graph Theory' article. Here I want to revise the theory so as it can be extended to a greater range of interactive computer systems. We will use graphs to represent game-states and their transitions. This will give us the foundation to prove some interesting… Continue reading Modelling Games using Graph Theory

## 50% Win Rate Proof

Introduction Keith Burgun believes that the optimal win-rate for a game is 50%. This causes no end of debate every time he mentions it which annoys me both because I mostly agree with him and because it's the same conversation every time. Here I want to give my opinion and by opinion I mean… Continue reading 50% Win Rate Proof

## Modelling Puzzles using Graph Theory

If we want to talk about choice in interactive systems in a technical way it might be useful to have a shared understanding of graph theory. Graphs are a useful tool for understanding interactive systems as they can be used to model the possible states of the system and the possible state transitions at each… Continue reading Modelling Puzzles using Graph Theory

## Intent

This is the excerpt for your very first post.