Data.SBV.Examples.Queries.FourFours

A query based solution to the four-fours puzzle. Inspired by http://www.gigamonkeys.com/trees/

Try to make every number between 0 and 20 using only four 4s and any
mathematical operation, with all four 4s being used each time.

We pretty much follow the structure of http://www.gigamonkeys.com/trees/, with the exception that we generate the trees filled with symbolic operators and ask the SMT solver to find the appropriate fillings.

Documentation

data BinOp

Supported binary operators. To keep the search-space small, we will only allow division by 2 or 4, and exponentiation will only be to the power 0. This does restrict the search space, but is sufficient to solve all the instances.

Constructors

Plus

Minus

Times

Divide

Expt

Instances

Eq BinOp

Methods

(==) :: BinOp -> BinOp -> Bool

(/=) :: BinOp -> BinOp -> Bool

Data BinOp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinOp -> c BinOp

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BinOp

toConstr :: BinOp -> Constr

dataTypeOf :: BinOp -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c BinOp)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BinOp)

gmapT :: (forall b. Data b => b -> b) -> BinOp -> BinOp

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinOp -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinOp -> r

gmapQ :: (forall d. Data d => d -> u) -> BinOp -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> BinOp -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinOp -> m BinOp

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinOp -> m BinOp

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinOp -> m BinOp

Ord BinOp

Methods

compare :: BinOp -> BinOp -> Ordering

(<) :: BinOp -> BinOp -> Bool

(<=) :: BinOp -> BinOp -> Bool

(>) :: BinOp -> BinOp -> Bool

(>=) :: BinOp -> BinOp -> Bool

max :: BinOp -> BinOp -> BinOp

min :: BinOp -> BinOp -> BinOp

Read BinOp

Methods

readsPrec :: Int -> ReadS BinOp

readList :: ReadS [BinOp]

readPrec :: ReadPrec BinOp

readListPrec :: ReadPrec [BinOp]

Show BinOp

Methods

showsPrec :: Int -> BinOp -> ShowS

show :: BinOp -> String

showList :: [BinOp] -> ShowS

HasKind BinOp

Methods

kindOf :: BinOp -> Kind

hasSign :: BinOp -> Bool

intSizeOf :: BinOp -> Int

isBoolean :: BinOp -> Bool

isBounded :: BinOp -> Bool

isReal :: BinOp -> Bool

isFloat :: BinOp -> Bool

isDouble :: BinOp -> Bool

isInteger :: BinOp -> Bool

isUninterpreted :: BinOp -> Bool

showType :: BinOp -> String

SymWord BinOp

Methods

forall :: String -> Symbolic (SBV BinOp)

forall_ :: Symbolic (SBV BinOp)

mkForallVars :: Int -> Symbolic [SBV BinOp]

exists :: String -> Symbolic (SBV BinOp)

exists_ :: Symbolic (SBV BinOp)

mkExistVars :: Int -> Symbolic [SBV BinOp]

free :: String -> Symbolic (SBV BinOp)

free_ :: Symbolic (SBV BinOp)

mkFreeVars :: Int -> Symbolic [SBV BinOp]

symbolic :: String -> Symbolic (SBV BinOp)

symbolics :: [String] -> Symbolic [SBV BinOp]

literal :: BinOp -> SBV BinOp

unliteral :: SBV BinOp -> Maybe BinOp

fromCW :: CW -> BinOp

isConcrete :: SBV BinOp -> Bool

isSymbolic :: SBV BinOp -> Bool

isConcretely :: SBV BinOp -> (BinOp -> Bool) -> Bool

mkSymWord :: Maybe Quantifier -> Maybe String -> Symbolic (SBV BinOp)

SatModel BinOp

Methods

parseCWs :: [CW] -> Maybe (BinOp, [CW])

cvtModel :: (BinOp -> Maybe b) -> Maybe (BinOp, [CW]) -> Maybe (b, [CW])

SMTValue BinOp

Methods

sexprToVal :: SExpr -> Maybe BinOp

Show (T BinOp UnOp)

A rudimentary Show instance for trees, nothing fancy.

Methods

showsPrec :: Int -> T BinOp UnOp -> ShowS

show :: T BinOp UnOp -> String

showList :: [T BinOp UnOp] -> ShowS

data UnOp

Supported unary operators. Similar to BinOp case, we will restrict square-root and factorial to be only applied to the value @4.

Constructors

Negate

Sqrt

Factorial

Instances

Eq UnOp

Methods

(==) :: UnOp -> UnOp -> Bool

(/=) :: UnOp -> UnOp -> Bool

Data UnOp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UnOp -> c UnOp

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UnOp

toConstr :: UnOp -> Constr

dataTypeOf :: UnOp -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c UnOp)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UnOp)

gmapT :: (forall b. Data b => b -> b) -> UnOp -> UnOp

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UnOp -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UnOp -> r

gmapQ :: (forall d. Data d => d -> u) -> UnOp -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UnOp -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UnOp -> m UnOp

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UnOp -> m UnOp

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UnOp -> m UnOp

Ord UnOp

Methods

compare :: UnOp -> UnOp -> Ordering

(<) :: UnOp -> UnOp -> Bool

(<=) :: UnOp -> UnOp -> Bool

(>) :: UnOp -> UnOp -> Bool

(>=) :: UnOp -> UnOp -> Bool

max :: UnOp -> UnOp -> UnOp

min :: UnOp -> UnOp -> UnOp

Read UnOp

Methods

readsPrec :: Int -> ReadS UnOp

readList :: ReadS [UnOp]

readPrec :: ReadPrec UnOp

readListPrec :: ReadPrec [UnOp]

Show UnOp

Methods

showsPrec :: Int -> UnOp -> ShowS

show :: UnOp -> String

showList :: [UnOp] -> ShowS

HasKind UnOp

Methods

kindOf :: UnOp -> Kind

hasSign :: UnOp -> Bool

intSizeOf :: UnOp -> Int

isBoolean :: UnOp -> Bool

isBounded :: UnOp -> Bool

isReal :: UnOp -> Bool

isFloat :: UnOp -> Bool

isDouble :: UnOp -> Bool

isInteger :: UnOp -> Bool

isUninterpreted :: UnOp -> Bool

showType :: UnOp -> String

SymWord UnOp

Methods

forall :: String -> Symbolic (SBV UnOp)

forall_ :: Symbolic (SBV UnOp)

mkForallVars :: Int -> Symbolic [SBV UnOp]

exists :: String -> Symbolic (SBV UnOp)

exists_ :: Symbolic (SBV UnOp)

mkExistVars :: Int -> Symbolic [SBV UnOp]

free :: String -> Symbolic (SBV UnOp)

free_ :: Symbolic (SBV UnOp)

mkFreeVars :: Int -> Symbolic [SBV UnOp]

symbolic :: String -> Symbolic (SBV UnOp)

symbolics :: [String] -> Symbolic [SBV UnOp]

literal :: UnOp -> SBV UnOp

unliteral :: SBV UnOp -> Maybe UnOp

fromCW :: CW -> UnOp

isConcrete :: SBV UnOp -> Bool

isSymbolic :: SBV UnOp -> Bool

isConcretely :: SBV UnOp -> (UnOp -> Bool) -> Bool

mkSymWord :: Maybe Quantifier -> Maybe String -> Symbolic (SBV UnOp)

SatModel UnOp

Methods

parseCWs :: [CW] -> Maybe (UnOp, [CW])

cvtModel :: (UnOp -> Maybe b) -> Maybe (UnOp, [CW]) -> Maybe (b, [CW])

SMTValue UnOp

Methods

sexprToVal :: SExpr -> Maybe UnOp

Show (T BinOp UnOp)

A rudimentary Show instance for trees, nothing fancy.

Methods

showsPrec :: Int -> T BinOp UnOp -> ShowS

show :: T BinOp UnOp -> String

showList :: [T BinOp UnOp] -> ShowS

type SBinOp = SBV BinOp

Symbolic variant of BinOp.

type SUnOp = SBV UnOp

Symbolic variant of UnOp.

data T b u

The shape of a tree, either a binary node, or a unary node, or the number 4, represented hear by the constructor F. We parameterize by the operator type: When doing symbolic computations, we'll fill those with SBinOp and SUnOp. When finding the shapes, we will simply put unit values, i.e., holes.

Constructors

B b (T b u) (T b u)

U u (T b u)

F

Instances

Show (T BinOp UnOp)

A rudimentary Show instance for trees, nothing fancy.

Methods

showsPrec :: Int -> T BinOp UnOp -> ShowS

show :: T BinOp UnOp -> String

showList :: [T BinOp UnOp] -> ShowS

allPossibleTrees :: [T () ()]

Construct all possible tree shapes. The argument here follows the logic in http://www.gigamonkeys.com/trees/: We simply construct all possible shapes and extend with the operators. The number of such trees is:

>>> length allPossibleTrees
640

Note that this is a lot smaller than what is generated by http://www.gigamonkeys.com/trees/. (There, the number of trees is 10240000: 16000 times more than what we have to consider!)

fill :: T () () -> Symbolic (T SBinOp SUnOp)

Given a tree with hols, fill it with symbolic operators. This is the trick that allows us to consider only 640 trees as opposed to over 10 million.

sCase :: (SymWord a, Mergeable v) => SBV a -> [(a, v)] -> v

Minor helper for writing "symbolic" case statements. Simply walks down a list of values to match against a symbolic version of the key.

eval :: T SBinOp SUnOp -> Symbolic SInteger

Evaluate a symbolic tree, obtaining a symbolic value. Note how we structure this evaluation so we impose extra constraints on what values square-root, divide etc. can take. This is the power of the symbolic approach: We can put arbitrary symbolic constraints as we evaluate the tree.

generate :: Integer -> T () () -> IO (Maybe (T BinOp UnOp))

In the query mode, find a filling of a given tree shape t, such that it evalutes to the requested number i. Note that we return back a concrete tree.

find :: Integer -> IO ()

Given an integer, walk through all possible tree shapes (at most 640 of them), and find a filling that solves the puzzle.

puzzle :: IO ()

Solution to the puzzle. We have:

>>> puzzle
0: (4 + (4 - (4 + 4)))
1: (4 / (4 + (4 - 4)))
2: sqrt((4 + (4 * (4 - 4))))
3: (4 - (4 ^ (4 - 4)))
4: (4 * (4 ^ (4 - 4)))
5: (4 + (4 ^ (4 - 4)))
6: (4 + sqrt((4 * (4 / 4))))
7: (4 + (4 - (4 / 4)))
8: (4 - (4 - (4 + 4)))
9: (4 + (4 + (4 / 4)))
10: (4 + (4 + (4 - sqrt(4))))
11: (4 + ((4 + 4!) / 4))
12: (4 * (4 - (4 / 4)))
13: (4! + ((sqrt(4) - 4!) / sqrt(4)))
14: (4 + (4 + (4 + sqrt(4))))
15: (4 + ((4! - sqrt(4)) / sqrt(4)))
16: (4 + (4 + (4 + 4)))
17: (4 + ((sqrt(4) + 4!) / sqrt(4)))
18: -(4 + (4 - (4! + sqrt(4))))
19: -(4 - (4! - (4 / 4)))
20: (4 * (4 + (4 / 4)))