Some 40 new ECLiPSe models
During the last days I have published about 40 new ECLiPSe models on my ECLiPSe page. They are all listed below.
A major part are ports from my SICStus Prolog models that I wrote some months ago, and I have not changed much from the SICStus models. Also, most of them - in turn - was first written in MiniZinc (see my MiniZinc page).
However, some small puzzles are completely new. By a freaky coincidence two are some kind of weighting problems (for comparison, the corresponding MiniZinc model are also linked):
A major part are ports from my SICStus Prolog models that I wrote some months ago, and I have not changed much from the SICStus models. Also, most of them - in turn - was first written in MiniZinc (see my MiniZinc page).
However, some small puzzles are completely new. By a freaky coincidence two are some kind of weighting problems (for comparison, the corresponding MiniZinc model are also linked):
- broken_weights.ecl: Broken weights problem. (MiniZinc: broken_weights.mzn). Problem from "Math Less Traveled": The broken weight problem
- divisible_by_9_trough_1.ecl: Divisible by 9 trough 1 (truncated numbers). In "any" base. (MiniZinc: divisible_by_9_trough_1.mzn). Problem from Microsoft, Visual C# Developer Center Solving Combinatory Problems with LINQ
- hanging_weights.ecl: Hanging weights problem. (MiniZinc: hanging_weights.mzn). Problem from Using LINQ to solve puzzles where a C#/LINQ solution is shown.
The new models
Here is all the new ECLiPSe models.- 3_jugs2.ecl: 3 jugs problem, Constraint Programming solution. Compare with the MIP solution in 3_jugs.ecl
- all_differ_from_at_least_k_pos.ecl: Global constraint all_differ_from_at_least_k_pos (decomposition)
- all_equal.ecl: Global constraint all_equal (decomposition)
- all_min_dist.ecl: Global constraint all_min_dist (decomposition)
- alldifferent_cst.ecl: Global constraint alldifferent_cst (decomposition)
- alldifferent_modulo.ecl: Global constraint alldifferent_modulo (decomposition)
- alldifferent_on_intersection.ecl: Global constraint alldifferent_on_intersection (decomposition)
- allpartitions.ecl: All partitions
- alpha.ecl: alphametic problem (cf. crypto.ecl)
- averbach_1.2.ecl: Seating puzzle, Problem 1.2 from Averbach & Chein "Problem Solving Through Recreational Mathematics"
- averbach_1.3.ecl: Problem 1.3 from Averbach & Chein "Problem Solving Through Recreational Mathematics"
- averbach_1.4.ecl: Seating puzzle, Problem 1.4 from Averbach & Chein "Problem Solving Through Recreational Mathematics"
- broken_weights.ecl: Broken weights problem. From "Math Less Traveled": The broken weight problem
- clock_triplet.ecl: Dean Clark's Clock Triplets Problem
- crew.ecl:Crew allocation problem discrete_tomography.ecl: Discrete tomography problem
- divisible_by_9_trough_1.ecl: Divisible by 9 trough 1 (truncated numbers). In "any" base. From Microsoft, Visual C# Developer Center Solving Combinatory Problems with LINQ
- fancy.ecl: Mr Greenguest puzzle (Fancy dress problem, from LPL)
- fill_a_pix.ecl: Fill-a-pix problem
- futoshiki.ecl: Futoshiki puzzle
- hamming_distance.ecl: Hamming distance
- hanging_weights.ecl: Hanging weights problem. From Using LINQ to solve puzzles where a C#/LINQ solution is shown.
- huey_dewey_louie.ecl: Huey Dewey Louie logical puzzle
- jobs_puzzle.ecl: Jobs puzzle (standard problem from Automatic Reasoning)
- just_forgotten.ecl: Just forgotten (Enigma puzzle #1517)
- K4P2GracefulGraph2.ecl: K4P2 GracefulGraph
- kakuro.ecl: Kakuro, a grid puzzle
- killer_sudoku.ecl: Killer Sudoku, another grid puzzle (variant of Sudoku)
- knapsack_investments.ecl: Knapsack investments (from Lundgren, Rönnqvist, Värbrand "Optimeringslära")
- lectures.ecl: Lectures puzzle (from Biggs "Discrete Mathematics")
- lichtenstein_coloring.ecl: Coloring problem: coloring Liechtenstein's communes and exclaves (Problem from bit-player.org)
- magic_hexagon.ecl: Magic hexagon (CSPLib problem 23)
- marathon2.ecl: Marathon problem (problem from XPress)
- miss_manners.ecl: Miss Manners's seating problem (benchmark for rules engines)
- nadel.ecl: B.A. Nadel's construction problem (From Rina Dechter "Constraint Processing", page 5)
- olympic.ecl: Olympic puzzle (standard Prolog problem)
- pert.ecl: Scheduling, simple PERT problem (Van Hentenryck)
- scheduling_speakers.ecl: Scheduling speakers (Rina Dechter "Constraint Processing", page 72)
- strimko2.ecl: Strimko puzzles (Latin squares with "streams")
- tourist_site_competition.ecl: Tourist site competition (P. Flener)