Smap

Choose the version you want to view.

Current version:Version message:

Adapted to new CLP.FD library

Click on a tag to show all related programs.

curry constraints finite_domain

Click on the badge to open the comment window for viewing and writing comments.

No comments yet.

Created by mh on May 19, 2015 (last modified on April 24, 2023)

1 user favorited this

Description: Computing magic series with FD constraints in Curry.

Source code (Latest version):

----------------------------------------------------------------------------
--- Computing magic series.
--- A series [a_0,a_1,....,a_(n-1)] is called magic iff there are
--- a_i occurrences of i in this series, for all i=1,...,n-1
---
--- Adapted from an example of the TOY(FD) distribution.
----------------------------------------------------------------------------

import CLP.FD

--- Computes a magic series of the length of the argument.
magic :: Int -> [Int]
magic n =
 let vs = take n (domain 0 (n-1))  -- FD variables
     is = map fd (take n [0..])    -- FD constants: indices of elements
 in solveFD [FirstFail] vs $
      constrain vs vs is /\
      sum vs Equ (fd n) /\
      scalarProduct is vs Equ (fd n)

constrain :: [FDExpr] -> [FDExpr] -> [FDExpr] -> FDConstr
constrain []     _  _      = true
constrain (x:xs) vs (i:is) = count i vs Equ x /\ constrain xs vs is

--- The infinite sequence of magic series of increasing lengths.
magicFrom :: Int -> [[Int]]
magicFrom n = magic n : magicFrom (n+1)

--- Returns 3 magic series of increasing lengths starting with length 7.
main :: [[Int]]
main = take 3 (magicFrom 7)
--> [[3,2,1,1,0,0,0],[4,2,1,0,1,0,0,0],[5,2,1,0,0,1,0,0,0]]

Options

Versions

2 versions

Tags

3 tags

Comments

0 comments »

Magic series

implemented in Curry