Solve triangle solitaire puzzle: Difference between revisions
m
Noticed that the output is not incorrect, just worded ambiguously.
(→{{header|Go}}: Removed unnecessary type alias.) |
m (Noticed that the output is not incorrect, just worded ambiguously.) |
||
Line 1,539:
=={{header|Racket}}==
{{incorrect|Racket|Should the output start 6 jumps 3, then 15 jumps 10 ... rather than 1 jumps 3, then 6 jumps 10 ... ?
<br/>
Not so fast... The output is correct if one reads the statement differently. The first number is the arrival<br/>position, the second number is the position where the peg is "jumped over" and is to be removed.<br/><br/>The position of where the peg jumps <b><i>from</i></b> is not indicated - but it can only be a single possibility in each case.}}
* This includes the code to generate the list of available hops (other implementations seem to have the table built in)
* It produces a full has containing all the possible results from all possible start positions (including ones without valid hops, and unusual starts). It takes no time... and once this is pre-calculated then some of the questions you might want answered about this puzzle can be more easily answered!
| |||