From: "Simon Kröger" <SimonKroeger@...>
Date: 2006-01-02T08:10:39+09:00
Subject: Re: [SOLUTION] Numeric Maze (#60)


Ok, my solution. It keeps track of all reached numbers *and* how it gets 
there in a hash (path). When the target is in the hash we simply have to 
go backwards and remember the values we pass on the way.

It does the 222 -> 9999 in 6.2s on my 2GHz+something system.
(should be easy to do a search from both sides, but no time [yet])

cheers

Simon
----------------------------------------------------------------
from, to = ARGV.shift || 222, ARGV.shift || 9999
t = Time.now

path = {from => :found}
while not path.include? to
   path.keys.each do |n|
     path[n + 2] = :add unless path.include?(n + 2)
     path[n * 2] = :mul unless path.include?(n * 2)
     path[n / 2] = :div unless (n % 2) != 0 || path.include?(n / 2)
   end	
end

result = [to]
loop do
   case path[result.last]
     when :add then result << result.last - 2
     when :mul then result << result.last / 2
     when :div then result << result.last * 2
     else break
   end
end

p result.reverse
puts "Time: #{Time.now - t}s"
----------------------------------------------------------------