[ Index | Introduction | Base | Recursion | Loops | Summary | RakuConf | B3A761B38 ]
The Nine Billionth name is B3A761B38
If you want to have a go at it, this is the command:
$ ./generate-words-loops -a=13
I gave up calculating the answer in August 2024, as it took too long to compute. I have gotten a faster computer now, so here are the updated results. The alphabet size is specified with the «-a» command line option, and the time usage is easily reported by adding «time» before the command. E.g.:
$ time ./generate-words-loops -a=1
| Alphabet Size | Number of Words | Percent of Target | Run Time Base | Run Time Recursion | Run Time Loops | Last Name |
| 1 | 3 | 0 | 0.16s | 0.18s | 0.23s | 111 |
| 2 | 650 | 0 | 0.28s | 0.34s | 0.36s | 222122212 |
| 3 | 25,203 | 0.0002 | 2.8s | 9.3s | 2.6s | 333233323 |
| 4 | 325,092 | 0.0036 | 31s | 2m 28s | 34.7s | 444344434 |
| 5 | 2,347,955 | 0.026 | 4m 7s | - | 3m 28s | 555455545 |
| 6 | 11,813,838 | 0.1312 | 21m 44s | - | 17m 7s | 666566656 |
| 7 | 46,374,195 | 0.5152 | 1h 16m | - | 1h 5m | 777677767 |
| 8 | 151,820,168 | 1.6868 | 3h 57m | - | 3h 25m | 888788878 |
| 9 | 432,661,347 | 4.8073 | 10h 53m | - | 8h 47m | 999899989 |
| 10 | 1,105,113,810 | 12.279 | - | - | 25h 43m | AAA9AAA9A |
| 11 | 2,583,116,723 | 28.7012 | - | - | 53h 29m | BBBABBBAB |
| 12 | 5,610,940,140 | 62.3437 | - | - | 5d 8h | CCCBCCCBC |
| 13 | 9,000,000,000 | 100 | - | - | 7d 14h | B3A761B38 |
| 13* | 11,459,252,883 | 127.325 | - | - | 11d | DDDCDDDCD |
The last one (marked 13*) is the result of removing the «stop at target»
condition. Then we go through all the combinations, and the last name is
DDDCDDDCD
[ Index | Introduction | Base | Recursion | Loops | Summary | RakuConf | B3A761B38 ]