Talk:24 game: Difference between revisions

m
m (→‎Autohotkey and Untested: added more verbiage.)
Line 66:
==Scala only presenting numbers with solutions==
I note that the impressive Scala example seems to only present a set of numbers guaranteed to have a solution. i can't help but think that from playing the game, some of the fun is ''lost'', as we quite enjoyed trying the toughies - not knowing if they actually had a solution or not as most numbers do. I guess they don't have to add much for a solution to [[24 game Player]]. --[[User:Paddy3118|Paddy3118]] 06:43, 28 April 2010 (UTC)
 
: I couldn't quite understand fully the meaning of the penultimate statement as it appears it may be missing an Oxford comma. &nbsp; Most numbers <u>don't</u> have a solution. &nbsp; (See the next talk section). &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 08:04, 15 March 2017 (UTC)
 
 
==REXX only presenting digits with at least one solution==
I have programmed the REXX example to also only present a set of digits that have a solution &nbsp; (as does '''Scala''').
 
From the task preamble:
 
''The goal is for the player to enter an expression that (numerically) evaluates to '''24'''. ''
 
Nowhere does it imply that an impossible set of digits is to be determined and, somehow, the user is
supposed to &nbsp; ''not'' &nbsp; enter a solution; &nbsp; as it is, no computer programming entry checks for a &nbsp; ''not possible'' &nbsp; answer for a solution.
 
When presented with the digits &nbsp; &nbsp; '''1 7 6 8''', &nbsp; &nbsp; what should a carbon-based life form (user) respond with for an answer (which is a non-solution)?
 
No such animal?
N/A
there ain't one
not possible
nope.
I give up.
I don't know
Please tell me the answer!!!
bupkis
Some of the solvable digits (numbers) are hard enough to find a solution, and presenting an unsolvable problem doesn't seem to be fair or realistic, since this is a game, not a riddle, and the game is to find a solution, not none-solutions.
 
 
Of the &nbsp; 6,561 &nbsp; legal/valid numbers (with four digits) that can be presented &nbsp; (numbers without any zeroes), &nbsp; 3,024 are solvable &nbsp; (that represents about &nbsp; '''46%''' &nbsp; solvable). &nbsp; This presumes that the REXX program correctly solved all possible (allowable) numbers.
&nbsp; (I have a complete list and I'm not afraid to use it.) &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 08:04, 15 March 2017 (UTC)