Sha256: 8d175b2733a972bee2b4a8ecdc33109aab67031ed7e9ab0f0ea2999f1837da9a
Contents?: true
Size: 1.22 KB
Versions: 21
Compression:
Stored size: 1.22 KB
Contents
require File.dirname(__FILE__) + '/example_helper' # Solves the send+more=money problem: # http://en.wikipedia.org/wiki/Send%2Bmore%3Dmoney class SendMoreMoney < Gecode::Model def initialize # Set up the variables, 8 letters with domain 0..9. s,e,n,d,m,o,r,y = @letters = int_var_array(8, 0..9) # Set up the constraints. # The equation must hold. (equation_row(s, e, n, d) + equation_row(m, o, r, e)).must == equation_row(m, o, n, e, y) # The initial letters may not be 0. s.must_not == 0 m.must_not == 0 # All letters must be assigned different digits. @letters.must_be.distinct # Set the branching. branch_on @letters, :variable => :smallest_size, :value => :min end def to_s %w{s e n d m o r y}.zip(@letters).map do |text, letter| "#{text}: #{letter.value}" end.join(', ') end private # A helper to make the linear equation a bit tidier. Takes a number of # variables and computes the linear combination as if the variable # were digits in a base 10 number. E.g. x,y,z becomes # 100*x + 10*y + z . def equation_row(*variables) variables.inject{ |result, variable| variable + result*10 } end end puts SendMoreMoney.new.solve!.to_s
Version data entries
21 entries across 21 versions & 2 rubygems