Hi guys, I tried to create an algorithm for finding a solution to SAT. It doesn't use branching and backtracking, unlike algorithms that use the DPLL skeleton. You can try this algorithm for different formulas in CNF. Please ask questions.
Second page
Third page
The only booleans I need are true, false, and maybe.