For more than 40 years, the satisfiability problem (SAT) has been one of the central issues in the theory of computation. Since it was determined that it is a NP-complete problem, scientists are looking for efficient heuristics. Because of the fact that the SAT problem plays an important role in the development of efficient computer systems, a real competition to find heuristics started all over the world. 3-SAT has a pioneering role in this research. This thesis is part of the work of a research community of American universities and the University of Graz. It?s goal is the development of two algorithms for the computation of such 3-SAT problems. The main focus of this work lies on the implementation of the algorithms. Furthermore, a first analysis and evaluation of the results should be performed. In the first part of the paper, the construction of the objective function for both computer programs is described. In this context, the clauses are converted into a discrete decision problem without constraints. This process is done with the help of penalty functions. The first computer program used in order to solve the objective function is the xQx-method. This approach allows only linear and quadratic terms in the objective function. For this reason, in a first step, the cubic terms have to be eliminated. This happens by implementing additional variables and penalty functions. Finally, the system of equations is solved with the use of a program called LocalSolver. The second method is a type of Simple One-Pass heuristic. This algorithm is basically a weighting method that determines the solution of the decision variables step by step. The advantage of this in comparison to the xQx-method is that no new variables need to be introduced. Therefore, the time of the calculation is significantly lower.