This paper reports on the simplification of Boolean functions problem encountered in the logic circuit design. The simplification process studied in this work is concentrated on the Petrick’s Method, produce all solutions exactly rather then Quine McCluskey or Karnaugh Method. The Petrick’s algorithm is described in detail. A specific example is worked through to explain the algorithm. On the example, all different possible solutions and “PLA” diagrams of these solutions are given as program outputs. Also, in this context, the comparisions of the methods used for simplification of Boolean functions are given.