N = 65 // when max reached, set to min and move pointer to leftįor (r=q=p=9 r & 7 ) // r must start as any odd number Runtime 51 min, file size 113,637,155,697 (no leading blanks this time)Ī side note: obviously the output file is very compressible, still I had to kill 7zip, after working 36 hours it was at 70%. Still not the shortest, but at least this one terminates and generates the required output. Please tell me the monks' email address, so that I can send them the zipped file, for manual check.Įdit Golfed a little more, reworked the check for repeated letters. Next edit with the runtime and size of names file. But a human should be able to read through the file and confirm they are all there and in whatever logical order you choose, assuming they have the time.
Or you can print all the names starting with A, then all the ones starting with B, or some other pattern. You can print out all the 1-letter names first, then all the 2-letter names, etc. But the particular sequence is up to you. The shortest solution by June 1st 2014 wins.Įdit: The names should start with A and end with MMMLMMMLM, progressing through all the billions of names sequentially. This is code-golf, and you can use any language. Your program should print out (to a file) every possible name in sequence from A to MMMLMMMLM, separated by any character not in the alphabet (newlines, semi-colons, whatever). No character may repeat more than 3 times in succession. The minimum length of a possible name is 1 character. You may use ABCDEFGHIJKLM or some other set of 13 characters. The monk's alphabet uses 13 characters (according to my estimations). In the story, the monastery hires some engineers to write a program to do all the work for them.
Essentially, they are devoted to writing every possible permutation of their alphabet, restricted by a few rules. It's about a group of Tibetan monks whose order is devoted to writing down all the possible names of God, written in their own alphabet. The 9 Billion Names of God is a short story by Arthur C.
0 kommentar(er)
