Our first example of the hypergraph visualisation approach takes a very simple instantiation of H-IFF, defined over only four dimensions (see Fig.4). The symmetry of the display instantly reveals the symmetry of the underlying function.
Examining a hypergraph for a larger space (see Fig.5) shows the generality of the structures observed in Fig.4. The visualisation tool allows some aspects of the cost surface to be directly displayed.
Number of local optima. The local optima can be highlighted, and doing so reveals that they always fall along the diagonal (as observed in the four-dimensional case). Thus, the number of local optima is the square root of the size of the space, 2n/2. Furthermore, there are an equal number of local pessima (points that have no worse neighbours) which fall along the other diagonal, all of which are global pessima.
Size and shape of basins of attraction. Some insights can be drawn about the size and shape of the basins of attraction for the local optima, shown in Fig.6. The most obvious observation is that that basin of attraction for the global optimum is a Sierpinski triangle (made more obvious by the manner in which points are highlighted in Fig.6). The recursive structure shows that the size of each basin is given by 3n/2. Thus, the basins scale in proportion to (the number of points in the Sierpinsky triangle) / (the size of the space), or 3n/2/2n = (3/4)n/2.
Not only does the basin of attraction form a Sierpinski triangle for the global optima, the basins of attraction for local optima are also variants of the Sierpinski triangle (see Fig.6b). Thus, a cursory visual inspection using the hypergraph tool reveals that the basins of attraction for all local optima are of the same size. The size and shape of these basins suggests that random adaptive walks are as likely to terminate at the global optima as they are to terminate at a local optimum (i.e., all outcomes are equally likely). Further detailed analysis revealed that this speculation was indeed correct.
Interactions between basins of attraction. Such a landscape is very difficult to optimise using hill-climbing approaches. The only points in common between the basins of attraction for 00000000 (Fig.6a) and 11111111 (not shown, but symmetric) are the pessima, which lie along the diagonal. In fact, the pessima belong to the basin of attraction for all local optima, or conversely, any local optimum can be reached by an adaptive walk from any pessimum. The separation of the basins at such a low level of fitness indicates a watershed in the landscape that would be difficult to traverse with hill-climbing algorithms. The H-IFF task was designed to be difficult for mutation alone, and the hypergraph makes the success of this design goal directly apparent.