Exhaustive Search of Piece Combinations Based on Total Shannon Value

In chess games, the Shannon value is one way to represent the relative values of chess pieces. We propose a method to perform an exhaustive search of piece combinations based on any given total Shannon value. Nested loops are used along with certain sentinel controls that comply with the basic rules of chess. For example, there are 9 loops assigned for the queen, as the maximum legal number of queens on the board is 9, including the promoted pawns. Therefore, each chess piece (queen, rook, bishop, knight, pawn) has its own specific number of loops which correspond to its legal number and they are nested in together. The experiment performed shows that if nested loops that represent each of the pieces are arranged together along with the chess-based sentinel controls, they can produce all possible and legal chess piece combinations that match the desired Total Shannon Value (TSV). This method can be used for a variety of purposes in chess engines and other games or areas with similar constructs and constraints.