All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Metapuzzle II (Posted on 2023-02-14) Difficulty: 3 of 5
In solving the puzzle Phi Proximity Poser, a computer-minded solver might consider trying every possible configuration of formulae, in RPN form, where numbers are pushed onto a stack, and pulled by the dyadic operations, two of them off the stack at a time, replacing them with the result.

But how many formulae can be made so they can be evaluated, assuming one is going to try all possibilities by brute force? The easy part is that there are 9! ways of ordering the digits; the hard part is the placement of the operations.

Determine the overall number of valid formulae for part I of the Proximity puzzle.

Note: It's not expected that you exclude situations where intermediate results of zero are used as divisors.

As a bonus, do this for part II.

See The Solution Submitted by Charlie    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
correction to link in puzzleCharlie2023-02-22 13:11:03
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (9)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2023 by Animus Pactum Consulting. All rights reserved. Privacy Information