FIGURE 3

A hypercube in three dimensions. This figure represents a graph of a hypercube in which each node has three degrees and its position is denoted by three binary digits. The diameter of the graph is simply the maximum Hamming distance of 3 (111-000=3). The NK model works by assigning each node a fitness value, places agents across the nodes (though usually only a fraction of all possible nodes), and then allows the agents to search for better performance (indicated by the circles at some nodes) in reference to certain search rules and to the knowledge of other positions in the graph.