My JaCoP page

My JaCoP models

• CoinsGrid.java: Coins grid problem from Tony Hürlimann: "A coin puzzle - SVOR-contest 2007".
• CrossWord.java: Crossword (standard CP problem)
  
• DeBruijn.java: de Bruijn sequences, both "normal" and "arbitrary".
  Usage: java DeBruijn base n (m)
  where base is the base to work with, n is the "bit length" and m the optional length of the sequence (default length is base^n).
• DeBruijnIterate.java: generates de Bruijn sequences in smaller batches instead of all solutions. Note: This version use the new (as of 2008-08-19) search method IterateSolutionListener. (Thanks Radoslaw!)
  Usage: java DeBruijnIterate base n (m) (solutions in each batch)
• Diet.java: Simple diet problem.
• FurnitureMoving.java: Simple task optimization using cumulative.
• HakankUtil.java: some utilities. Is needed for some of these models.
• LeastDiff.java: Least diff problem, an alphametic puzzle, minimize the difference ABCDE-FGHIJ where A..J is integers 0..9 (all different)
• MineSweeper.java: Minesweeper problem.
  Problem files for the Minesweeper program.
  Usage: java Minesweeper problem file
  
  • Problem 0 from Gecode minesweeper.cc
  • Problem 1 from Gecode minesweeper.cc
  • Problem 2 from Gecode minesweeper.cc
  • Problem 3 from Gecode minesweeper.cc
  • Problem 4 from Gecode minesweeper.cc
  • Problem 5 from Gecode minesweeper.cc
  • Problem 6 from Gecode minesweeper.cc
  • Problem 7 from Gecode minesweeper.cc
  • Problem 8 from Gecode minesweeper.cc
  • Problem 9 from Gecode minesweeper.cc
  • From "Some Minesweeper Configurations",page 2
  • From "Some Minesweeper Configurations",page 3
  • From Richard Kaye: How Complicated is Minesweeper?, splitter (131072 solutions)
  • From Richard Kaye: How Complicated is Minesweeper?, wire
• QuasigroupCompletion.java: Quasigroup completion problem.
  Problem files:
  
  • quasigroup1.txt
  • quasigroup2.txt
  • quasigroup3.txt
  • quasigroup4.txt
  • quasigroup5.txt
  • quasigroup6.txt
  • quasigroup7.txt
  • quasigroup8.txt
  • quasigroup9.txt
• Seseman.java: Seseman convent problem, a simple recreational mathematics puzzle.
• SurvoPuzzle.java: Survo puzzle.
  Problem files:
  
  • survo_puzzle_126_2008.txt
  • survo_puzzle_127_2008.txt
  • survo_puzzle_128_2008.txt
• WhoKilledAgatha.java: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, a automated reasoning problem).
• WhoKilledAgatha_element.java: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, a automated reasoning problem). This version uses Element (with transposed matrices).
• WordSquare.java: Word square: fill a square matrix with words. Reads from a word list file (/usr/dict/words).
• YoungTableuax.java: Young tableaux and partitions