Talk:Pancake numbers: Difference between revisions
m (→no examples) |
(Everything is wrong) |
||
| Line 2: | Line 2: | ||
Guilty as charged for introducing the cheeky "gap" algorithm, but the task says "and for each show an example". Only five (F#, Go, Julia, Phix, and Wren) do so, the other 11 (ten of which were added after that clause appeared) do not and should really be marked as incorrect or incomplete. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 00:52, 18 January 2021 (UTC) |
Guilty as charged for introducing the cheeky "gap" algorithm, but the task says "and for each show an example". Only five (F#, Go, Julia, Phix, and Wren) do so, the other 11 (ten of which were added after that clause appeared) do not and should really be marked as incorrect or incomplete. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 00:52, 18 January 2021 (UTC) |
||
:Yet another no-example added, so I've marked now 12 entries as incomplete. The trivial gap algorithm does not help in comparing different programming languages, which is the primary purpose of this site, whereas something a bit more substantial should. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 01:24, 20 January 2021 (UTC) |
:Yet another no-example added, so I've marked now 12 entries as incomplete. The trivial gap algorithm does not help in comparing different programming languages, which is the primary purpose of this site, whereas something a bit more substantial should. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 01:24, 20 January 2021 (UTC) |
||
== Everything is wrong == |
|||
Every solution on this page was branched from an initial Phix algorithm by [[User:Petelomax]]. The page states that the algorithm was written by Pete, and that it was “was freshly made up”. It also states that it “It agrees with https://oeis.org/A058986/b058986.txt”. The issue is that it doesn’t. That lists <code>p(19)</code> as <code>22</code>, whereas the algorithm yields <code>21</code>. |
|||
Even if it’s right, I question the point of such providing such a solution. It’s mostly reverse-engineered guess-work from a solution generated by actual exhaustive search. Could we purge the page to only keeping solutions that *actually* find the solutions through exhaustive search? [[User:Monarchdodra|Monarchdodra]] ([[User talk:Monarchdodra|talk]]) 12:57, 9 March 2021 (UTC) |
|||
Revision as of 12:58, 9 March 2021
no examples
Guilty as charged for introducing the cheeky "gap" algorithm, but the task says "and for each show an example". Only five (F#, Go, Julia, Phix, and Wren) do so, the other 11 (ten of which were added after that clause appeared) do not and should really be marked as incorrect or incomplete. --Pete Lomax (talk) 00:52, 18 January 2021 (UTC)
- Yet another no-example added, so I've marked now 12 entries as incomplete. The trivial gap algorithm does not help in comparing different programming languages, which is the primary purpose of this site, whereas something a bit more substantial should. --Pete Lomax (talk) 01:24, 20 January 2021 (UTC)
Everything is wrong
Every solution on this page was branched from an initial Phix algorithm by User:Petelomax. The page states that the algorithm was written by Pete, and that it was “was freshly made up”. It also states that it “It agrees with https://oeis.org/A058986/b058986.txt”. The issue is that it doesn’t. That lists p(19) as 22, whereas the algorithm yields 21.
Even if it’s right, I question the point of such providing such a solution. It’s mostly reverse-engineered guess-work from a solution generated by actual exhaustive search. Could we purge the page to only keeping solutions that *actually* find the solutions through exhaustive search? Monarchdodra (talk) 12:57, 9 March 2021 (UTC)