Timeline for Generating combinations algorithmically
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2015 at 13:39 | comment | added | rrrrrrrrrrrrrrrr | Your new method is very similar to the one I've come up with this morning. I'm going to try to implement it later today. | |
| Oct 5, 2015 at 12:30 | history | edited | Gabriel | CC BY-SA 3.0 |
added 1571 characters in body
|
| Oct 5, 2015 at 12:01 | comment | added | Gabriel | I correct the code, it becomes even simpler, in a moment | |
| Oct 5, 2015 at 11:59 | comment | added | Gabriel | Jeah you are correct! | |
| Oct 5, 2015 at 11:39 | comment | added | rrrrrrrrrrrrrrrr |
@Gabriel If you look at my example, you will find that I've discarded the path 1 1 1 2 1, which contains a leap.
|
|
| Oct 5, 2015 at 11:37 | comment | added | Gabriel | yes, of course, if this is the case? then its a tree! we could add a leapCheck routine for every solution and discard it :-) | |
| Oct 5, 2015 at 8:43 | comment | added | COME FROM |
I guess paths with "leaps" are not legal. The path [2, 0, 0, 0, 0] for instance has a leap from column 2 to column 0.
|
|
| Oct 4, 2015 at 21:49 | review | First posts | |||
| Oct 6, 2015 at 3:41 | |||||
| Oct 4, 2015 at 21:45 | history | edited | Gabriel | CC BY-SA 3.0 |
deleted 819 characters in body
|
| Oct 4, 2015 at 21:40 | history | answered | Gabriel | CC BY-SA 3.0 |