In Computer Science, the Boolean Satisfiability Problem (Sat) Is the Problem of Deciding Whether There Exists a Translation That Fulfills a Given Boolean Equation. Sat Is One of the Principal Problems That Were Demonstrated to Be Np-Complete, Which Is Additionally Central to Artificial Intelligence, Algorithm and Hardware Design. This Paper Surveys the Primary Algorithm Called As Serial Sat Algorithms Which Can Complete or Incomplete.