Jump to content
BrainDen.com - Brain Teasers

Quantum.Mechanic

Members
  • Content count

    90
  • Joined

  • Last visited

Community Reputation

0

About Quantum.Mechanic

  • Rank
    Junior Member
  1. Who can go the lowest?

    Since the integer requirement, there haven't been any replies, so I'll go with an obvious, and not-likely-to-be-optimal one.
  2. OK, I thought that would be a good little puzzle program to write. I'm sure there's an easier way to figure this on paper though, waiting for y'all to clue me in. The first few elements led me to the following:
  3. Half as old as my brother

    Are we assuming a mammalian birth process? Then splitting is in utero, and age origin is time of birth. When in Thailand...
  4. Relatively prime

    Just for fun, I programmed up a little script. Using a suitable underlying GMP library for Euler's totient function, it checked up to 10 million in 13 seconds, with a result of 60.793% distinct pairs relatively prime.
  5. dice problem

    Maximum sum, or highest numbered side?
  6. dice problem

  7. Conditionally conflicting

  8. The army of ants

    I saw this puzzle in the same Peter Winkler book I mentioned elsewhere.
  9. 8th Graders olimpyad problem

    Testing a few targets other than 99,
  10. 8th Graders olimpyad problem

    I wrote a program to check.
  11. optimal game strat

    Are you sure? Because starting at line 193, it has: # This result might already exist. Keep the new one if the path is shorter. if (not exists($m->{$result}) or (scalar keys %$new_path < scalar keys %{$m->{$result}})) { # print STDERR "\tAdded $expression = $result\n"; $m->{$result} = $new_path; ++$results_added; }
  12. I just read an equivalent puzzle in a puzzle book, so I'll sit this one out...
  13. List of numbers

  14. optimal game strat

    Yes, that was possible for earlier versions. The current version gives me this: four_banger.pl 30 11 3 [...snip...] Steps for 11 => 3 (not in order): 11 / 11 = 1 1 + 1 = 2 2 + 1 = 3 [...snip...] because it compares multiple paths to the same goal, and keeps the shortest. (In case of ties, it takes the path with the smallest max operand.)
×