Session:

NuE - Neutral Evolution in Evolutionary Computation

Title:

Counting Solutions in Reduced Boolean Parity

Authors:

Mark Collins

Abstract:

Motivated by the interest in the boolean parity problem, this paper examines the structure of solutions to a simple form of the boolean parity problem and provides efficient methods for counting them. Understanding the structures which control solution distribution is important for understanding the performance of search mechanisms on the reduced boolean parity problem. Several search mechanisms have reportedly performed better than random search in solving the simplified form boolean parity problem, despite fitness neutrality leading to an absence of a search gradient, renewing interest in understanding the solution distribution.