prashanthmulge/SAT-Encoding-Solver

Implement a SAT solver to find a satisfying assignment for any given CNF sentences, You are also asked to implement the WalkSAT algorithm ( AIMA Figure 7.18 ) to search for a solution for an instance of wedding. Suppose you have a wedding to plan, and want to arrange the wedding seating for a certain number of guests in a hall. The hall has a certain number of tables for seating. Some pairs of guests are couples or close Friends (F) and want to sit together at the same table. Some other pairs of guests are Enemies (E) and must be separated into different tables. The rest of the pairs are Indifferent (I) to each other and do not mind sitting together or not. However, each pair of guests can have only one relationship, (F), (E) or (I). You must find a seating arrangement that satisfies all the constraints.

Python