This paper uses random sampling to validate the accuracy of a previously proposed method for counting solutions to the reduced Boolean parity problem. We find the performance of the random sampling to be well predicted by the method and confirm the apparent simplicity of this type of the Boolean parity problem.