blob: a8a3f31ccb502d4f81592680b58643df89069b72 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
+++
title = "Application-specific SAT solver"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["2e1c3"]
forwardlinks = ["2e1c5", "2e1c4a"]
zettelid = "2e1c4"
+++
Another solution might be to go down one of the branches, and basically
implement a slow and application-specific SAT solver.
``` c
else if (Q) { x = 2; }
else if (R) { x = 3; }
else { x = 4; }
```
``` c
P == false;
if (Q) { x = 2; }
else if (P) { x = 1; }
else if (R) { x = 3; }
else { x = 4; }
```
and:
``` c
x = 1
```
``` c
P == true;
if (Q) { x = 2; }
else if (P) { x = 1; }
else if (R) { x = 3; }
else { x = 4; }
```
|
