My Gecode/R page

My Gecode/R models

• all_different_except_0.rb: Global constraint all_different except 0
• all_interval.rb: All interval (series) problem (CSPLib problem 7)
• alpha.rb: Standard alphametic problem (B+A+L+L+E+T = 45 and 19 similiar constraints)
• coins_grid.rb: Placing coins on a grid (Tony Hurlimann)
• debruijn_binary.rb: de Bruijn sequences, both "classic" and "arbitrary"
• devils_word.rb: Devil's Word
• diet.rb: simple diet problem (operations research)
• eq20.rb: 20 linear equations (standard benchmark)
• global_cardinality.rb: Global constraint global cardinality
• golomb_ruler.rb: Golomb ruler problem (CSPLib number 6)
• langford.rb: Langford's number problem (CSPLib problem 24)
• least_diff.rb: Least diff problem, an alphametic puzzle, minimize the difference ABCDE-FGHIJ where A..J is integers 0..9 (all different)
• map.rb: Simple map coloring problem.
  
• minesweeper.rb: Minesweeper problem.
  Problem files for the Minesweeper program.
  Usage: ruby minesweeper.rb 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
• nonogram.rb: Nonogram (Paint by Numbers)
Problem files for nonogram.rb (most are from Gecode examples)
• nonogram_simple.txt: Very simple problem
• nonogram_bear.txt: Bear
• nonogram_castle.txt: Castle (benchmark, cf http://www.cs.kuleuven.be/~bmd/nonogram.pl, Prolog CLP program)
• nonogram_crocodile.txt: Crocodile
• nonogram_difficult.txt: Difficult
• nonogram_dragonfly.txt: Dragonfly
• nonogram_heart.txt: Heart
• nonogram_house.txt: House
• nonogram_nonunique.txt: Non unique problem (43 solutions)
• nonogram_p200.txt: P200
• nonogram_pinwheel.txt: Pinwheel
• nonogram_soccer_player.txt: Soccer player
• nonogram_unknown.txt: "Unkwnown"
• pandigital_numbers.rb: Pandigital numbers (any base <= 10)
• quasigroup_completion.rb: Quasigroup Completion
  Problem files for quasigroup_completion.rb:
  
  • quasigroup1.txt
  • quasigroup2.txt
  • quasigroup3.txt
  • quasigroup4.txt
  • quasigroup5.txt
  • quasigroup6.txt
  • quasigroup7.txt
  • quasigroup8.txt
  • quasigroup9.txt
• send_more_money_any_base.rb: SEND+MORE=MONEY in any base
• send_most_money2.rb: SEND+MOST=MONEY, finding all solutions of the max value for MONEY. (Simple extension of the example in the Gecode/R distribution.)
• seseman.rb: simple recreational mathematics puzzle. See the CGI-program Seseman convent problem
• set_partition.rb: Set partition problem: sums and sum_squared
• sliding_sum.rb: Global constrait sliding sum
• steiner.rb: Steiner triplets.
• survo_puzzle.rb: Survo puzzle
Problem files:

• survo_puzzle_126_2008.txt
• survo_puzzle_127_2008.txt
• survo_puzzle_128_2008.txt
• xkcd.rb: XKCD's knapsack problem. See the xkcd strip for the problem