Timeline for How to generate "meaningful combinations" from the set of characters?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 25, 2019 at 17:18 | vote | accept | Anthony | ||
| Dec 24, 2019 at 19:42 | comment | added | Christophe | @tosh In your approach when you want to eliminate some combinations such as CBXE. Her it goes further sine you could eliminate any combination such as AFCE that does not have its letters in the alphabetical order. You may make the combinatorial maths: how much possible combinations vs. how much combination that are alphabetically sorted. | |
| Dec 24, 2019 at 18:55 | comment | added | Anthony |
Do you mean that instead of checking each of CAFE, CAEF, CFAE, CFEA, CEAF, CEFA, ACFE, ACEF, AFCE, AFEC, AECF, AEFC, FCAE, FCEA, FACE, FAEC, FECA, FEAC, ECAF, ECFA, EACF, EAFC, EFCA, EFAC I can check just one ACEF? (I think it is) If so, then I steel didn't grasp, how should I eventually reach ACEF itself from all possibilites? Sorry if I speak vaguely.
|
|
| Dec 23, 2019 at 0:03 | history | edited | Christophe | CC BY-SA 4.0 |
added 310 characters in body
|
| Dec 22, 2019 at 23:49 | history | answered | Christophe | CC BY-SA 4.0 |