Timeline for Does this addition pyramid puzzle have a unique solution?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 31, 2019 at 19:08 | history | edited | Nick Kennedy | CC BY-SA 4.0 |
deleted 78 characters in body
|
| Jul 31, 2019 at 18:15 | comment | added | Jonathan Allan |
...Ƭ€Ṗ€a@ċ=1 saves two bytes (unless there are edge cases with the AND not catered for by the tests?)
|
|
| Jul 31, 2019 at 16:18 | comment | added | Nick Kennedy |
@KevinCruijssen now has been clarified that [[0,0],[0]] isn’t valid input.
|
|
| Jul 31, 2019 at 13:03 | comment | added | Nick Kennedy |
@KevinCruijssen I’ve asked for clarification whether input with no known values is valid. If so, I can change ‘ to »2 which also has the advantage of regaining the efficiency lost with my last change, albeit at the cost of a byte.
|
|
| Jul 31, 2019 at 12:53 | comment | added | Kevin Cruijssen |
Outputs truthy for [[0,0],[0]].
|
|
| Jul 31, 2019 at 7:42 | history | edited | Nick Kennedy | CC BY-SA 4.0 |
added 10 characters in body
|
| Jul 30, 2019 at 22:26 | history | edited | Nick Kennedy | CC BY-SA 4.0 |
added 147 characters in body
|
| Jul 30, 2019 at 22:17 | history | edited | Nick Kennedy | CC BY-SA 4.0 |
added 619 characters in body
|
| Jul 30, 2019 at 21:22 | comment | added | Nick Kennedy |
@Jonah the Catrtesian power ṗ of the max number in the grid with the length of the base. e.g. if The maximum number were 10 and the length of the base 4 then it would test everything from [1,1,1,1] to [10,10,10,10], i.e. 10000 possibilities.
|
|
| Jul 30, 2019 at 21:08 | comment | added | Jonah | Very nice. How does the "generate all possibilties" logic work? | |
| Jul 30, 2019 at 20:32 | history | answered | Nick Kennedy | CC BY-SA 4.0 |