Knuckle Cracker

My guess is 5,658,271,240,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 (5-22illion)

Which is the number of spaces able to be typed (60) and the number of enter-able keys on the keyboard (68)

So:
68 x 60!

Precisely 4 294 967 296, though it is possible that some are inaccessible. The code you enter is first reduced to a uint before it is used to generate the terrain, emitters, etc.

(You can multiply by 9 if you count different sizes/difficulties of a map separately and then it is a few more still if you consider that the check for whether or not experimentals are available in a map is based on a different uint when one or more of a certain set of foreign characters is used in the code, but whether or not to include these is a matter of preference.)

Quote from: mthw2vc on October 26, 2011, 06:55:19 PM
Precisely 4 294 967 296, though it is possible that some are inaccessible. The code you enter is first reduced to a uint before it is used to generate the terrain, emitters, etc.

(You can multiply by 9 if you count different sizes/difficulties of a map separately and then it is a few more still if you consider that the check for whether or not experimentals are available in a map is based on a different uint when one or more of a certain set of foreign characters is used in the code, but whether or not to include these is a matter of preference.)

dude, there is a lot more than that, just by inserting numbers there are 999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999 different possibilities...

Quote from: TheBlaster on November 07, 2011, 08:51:23 PM

Quote from: mthw2vc on October 26, 2011, 06:55:19 PM
Precisely 4 294 967 296, though it is possible that some are inaccessible. The code you enter is first reduced to a uint before it is used to generate the terrain, emitters, etc.

(You can multiply by 9 if you count different sizes/difficulties of a map separately and then it is a few more still if you consider that the check for whether or not experimentals are available in a map is based on a different uint when one or more of a certain set of foreign characters is used in the code, but whether or not to include these is a matter of preference.)

dude, there is a lot more than that, just by inserting numbers there are 999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999 different possibilities...

Seriously, there are "only" 4 billion custom maps, it's just that you can't tell the difference between that and nine hundred ninety-nine octodecillion maps.

Quote from: TheBlaster on November 07, 2011, 08:51:23 PM
just by inserting numbers there are 999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999,999 different possibilities...

Even if you were right you forgot map 0, so there would be 1 more. A hash is used however, stored in a 32-bit uint (unsigned integer), limiting the amount to 2^32.

One thing I find interesting about the maps
is the actual space between characters
changes the maps as well.


a a

is not the same as

a  a


Also, weird characters count as well, (different
languages, mathematical signs ect).

Whatever string you drop into that field is first hashed to a MD5, of which you then take the first 8 chars(which are hexadecimal) and you then convert that to a number. Mthw and Grauniad are correct in that there are nearly 4.3 billion, but you won't find indenticals by just entering a few random strings.

damn i wish our number system was in hexodecimal

Then you'd have to have 8 fingers/toes on each hand/foot.

my guess is with, 60 max characters and 68 different characters is
basically 68^60
which is an insanely HUGE number
which is
8.9234904331340688707650738291128e+109

Quote from: creeper killer on November 24, 2011, 10:41:13 PM
my guess is with, 60 max characters and 68 different characters is
basically 68^60
which is an insanely HUGE number
which is
8.9234904331340688707650738291128e+109

Please, stop guessing. There are (2³²) - 1 = 4 294 967 295 maps. That's a fact and the algorithm has been disclosed earlier in this thread. It is completely irrelevant how many characters can be typed into the code generation box, it is always reduced to one of the aforementioned   4 294 967 295 maps. Which means that there are approximately 2.07766202 × 10¹⁰⁰ ways to generate each map using your math. Actually there are more, because foreign characters, etc can be factored in and it increases the combinations, but who are going to count that?

Quote from: Grauniad on November 25, 2011, 02:14:42 AM

Quote from: creeper killer on November 24, 2011, 10:41:13 PM
my guess is with, 60 max characters and 68 different characters is
basically 68^60
which is an insanely HUGE number
which is
8.9234904331340688707650738291128e+109

Please, stop guessing. There are (2³²) - 1 = 4 294 967 295 maps. That's a fact and the algorithm has been disclosed earlier in this thread. It is completely irrelevant how many characters can be typed into the code generation box, it is always reduced to one of the aforementioned   4 294 967 295 maps. Which means that there are approximately 2.07766202 × 10¹⁰⁰ ways to generate each map using your math. Actually there are more, because foreign characters, etc can be factored in and it increases the combinations, but who are going to count that?

couldn't really figure out how the code map generation works, but my guess is to total possible combinations, can't figure out which 2+ combinations generate the same code map.
also, you can't enter foreign characters, I tried typing in Chinese and the box was left blank.

Quote from: creeper killer on November 25, 2011, 02:20:56 AM
couldn't really figure out how the code map generation works, but my guess is to total possible combinations, can't figure out which 2+ combinations generate the same code map.
also, you can't enter foreign characters, I tried typing in Chinese and the box was left blank.

There are foreign characters that do work. This is a list that MAdMag posted:
♪ ● ° Ω ′ Θ  « ¬ ® ¯ ± º ¹ ² ³ µ ¶ ¸ ¼ ½ ¾ ¿ À Á Â Ã Ä Å Æ Ç È É Ê Ë Ì Í Î Ï Ð Ñ Ò Ó Ô Õ Ö × Ø Ù Ú Û Ü Ý Þ ß à á â ã ä å æ ç è é ê ë ì í î ï ð ñ ò ó ô õ ö ÷ ø ù ú û ü ý þ ÿ ♪ ¤ o≡ Ξ ω θ ε ∞ ∫ œ ≈ ≠ ≤≥ ▪ ▫ ◊ ● □ † ∑ σ ζ ∂  ´¥`·. ]¦[ § ™ ‡ № ∆ √ ,, ...ˆ ‰ Œ � Ž " " ' ' š ₳ ฿ ₵ ¢ ₡ ₢ ₠ $ ₫₯ € ƒ ₣ ₲ ℠ ₦ ₱ ₨ ə ∏ ≈

Anything out of the standard ASCII collection of symbols should work.

I get [roughly] 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 maps

Quote from: Sushiman118 on November 19, 2012, 01:11:19 PMI get [roughly] 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 maps

Quote from: Grauniad on November 25, 2011, 02:14:42 AMPlease, stop guessing. There are (2³²) - 1 = 4 294 967 295 maps.

Everybody who seems to know what they're talking about (beyond guessing at how many numbers can fit in the box) seems to agree with this assessment.

ok, so the entry gets converted to a number, got it. this means FAR less maps. :(

http://knucklecracker.com/forums/index.php?topic=8853.0
This thread shows that there's not all that many, and finding maps that were the same could very well have happend to somebody without the use of a script to check various combinations.