Challenges

[Hdjensofjfnen]

Easy challenge: write a URL for a google search, where the google search is a URL for the post you respond to this with.

This is indeed impossible - the Sandbox forum is not visible to unregistered users, and by extension, search engine bots.

[Moosey]

Easy challenge: write a URL for a google search, where the google search is a URL for the post you respond to this with.

This is indeed impossible - the Sandbox forum is not visible to unregistered users, and by extension, search engine bots.

You only need to make it so that the query in the google search is the url for the answer. Google doesn't have to do anything with search engine bots.
For instance, here's a google search URL returning a google search URL:
http://www.google.com/search?q=http://w ... %26num%3D0

[fluffykitty]

Easy challenge: write a URL for a google search, where the google search is a URL for the post you respond to this with.

This is indeed impossible - the Sandbox forum is not visible to unregistered users, and by extension, search engine bots.

Last time I checked (aka five seconds ago) it is.

[Hdjensofjfnen]

This is indeed impossible - the Sandbox forum is not visible to unregistered users, and by extension, search engine bots.

Last time I checked (aka five seconds ago) it is.

The forum directory is visible, but the threads within it are not.

[fluffykitty]

Last time I checked (aka five seconds ago) they are.

[Gustone]

Find a gun with the smallest bouding diamond width perpendicular to the glider stream

Code: Select all

x = 86, y = 61, rule = LifeHistory
34.2BD5.B$33.2B.2D4.B$33.B3.D4.B6.6B$31.2B5.D3.2B3.2B6.5B$29.3B7.D3.
5B11.3B$29.B9.2D2.B17.B$28.2B10.2D.B18.B$27.2B12.2D12B7.2B$26.2B15.2D
18.B$25.2B17.2D17.B$25.B19.2D17.B$24.B21.D18.B$23.2B19.2B19.B$23.B18.
3B20.B$23.B17.2B22.B$22.B17.B24.B$22.B16.B25.B$21.B16.2B25.B$20.B17.B
26.B$19.2B16.B27.B$17.2B18.B27.B$16.2B18.B28.B$15.D20.B28.B$16.D19.B
28.B$16.2D17.B29.B$17.2D15.B30.B$18.2D13.B31.B$17.A.D12.B32.B$16.A3.D
10.B33.B$16.3A2.2D7.B34.B$22.D6.B35.B$13.A9.D3.2B36.B$12.A10.2D.2B37.
B$12.3A9.2D38.B$64.B$9.A11.3B40.B$8.A11.B.3B38.B$8.3A8.2B.B.B38.B$22.
B.2B37.B$5.A16.B2.B36.B$4.A17.B39.B$4.3A15.B39.B$22.B38.B$.A20.B38.B$
A21.B38.B$3A20.B$23.B$11.3B43.4B8.5B$11.B21.B6.B8.B7.B3.3B4.2B3.B$11.
B7.2B2.B8.3B5.2B7.B7.B9.2B9.3B$11.B7.3B.2B7.B.2B5.B7.B7.B5.2B2.2B12.
5B$11.4B3.B2.B.3B5.2B3.B4.B7.2B6.6B5.B13.B$14.B3.B2.2B2.B5.2B3.B4.B8.
B6.B10.2B12.B$14.B2.2B2.2B2.B4.7B4.B8.B6.B11.B12.B$11.4B2.B3.2B2.2B3.
B5.2B3.B8.B6.B11.6B7.B$12.2B16.B6.B3.3B6.B6.8B9.B7.B$29.2B12.3B4.4B
20.B7.B$74.B7.B$68.2B3.2B7.B$69.5B8.B$82.2B!

[BlinkerSpawn]

Find a gun with the smallest bouding diamond width perpendicular to the glider stream

Simkin's p120 is gonna be pretty hard to beat at only 29hd:

Code: Select all

x = 52, y = 24, rule = LifeHistory
D20.2A5.D$.D6.4B2.B.3B.BABA5.D$2.D5.4B.8BA9B$3.D3.2A5B2A16B$4.D2.2A5B
2A16BD$5.D2.B.22B.D$6.D3.B2A21BD$7.D3.2A7B2.13BD$8.D2.8B6.10B.D$9.D3.
7B7.7B3.D$10.D.10B6.8B2.D$11.D13B2.9B3.D$12.D16B2AB2A3B3.D$13.D.13BA
5BA2B.B2.D$14.D13BA6BA2B2A2.D$15.13B3A3BA3B2A3.D$16.17BA.4B5.D$17.D5.
4B.3B.B2.4B6.D$18.D5.3B19.D$19.D5.4B18.D$20.D6.2A19.D$21.D5.A21.D$22.
D5.3A19.D$23.D6.A20.D!

[Moosey]

A difficult number-puzzle: go from 16 to 25 in two moves, using only the number two, the operations +, *, ^, /, and -, (only one operator per use) and adding together all digits once (per use). Not all of these must (or in this case can) be used.

[BlinkerSpawn]

A difficult number-puzzle: go from 16 to 25 in two moves, using only the number two, the operations +, *, ^, /, and -, (only one operator per use) and adding together all digits once (per use). Not all of these must (or in this case can) be used.

Either subtract two or multiply by two, then raise the digit sum to the second power

[Moosey]

A difficult number-puzzle: go from 16 to 25 in two moves, using only the number two, the operations +, *, ^, /, and -, (only one operator per use) and adding together all digits once (per use). Not all of these must (or in this case can) be used.

Either subtract two or multiply by two, then raise the digit sum to the second power

That counts as three moves

[BlinkerSpawn]

I interpreted the rules as allowing two expressions, each of which could use at most one of each symbol, is that not the case?

[Moosey]

Taking the digit sum counts as a move

Your solution takes three moves:
1) 16-2
2) 1+4
3) 5^2 = 25

(Also, FYI, I know there is a solution because I constructed the starting and ending numbers from how the solution would work)

[Moosey]

Posted on my wordpress blog

[testitemqlstudop]

Trivial:

1. 2^16 = 65536
2. Digit sum(65536) = 25

[testitemqlstudop]

New number challenge I made up:

You have a number x. You square it, sort the digits in non-descending order, and remove exactly one digit. The resulting number is 123456. What is the lexicographically smallest x?

[Moosey]

Trivial:

1. 2^16 = 65536
2. Digit sum(65536) = 25

Well done! That was the correct solution!

[Moosey]

Challenge: Implement a CA which plays Kirby-Paris Hydra games and calculate hydra(n)
I remember AforAmpere tried this but didn't finish

(*And I don't mean "use the fact that life is TC to say that life can do this" or similar-- a single cell should correlate to an open/close parenthesis)

[Hdjensofjfnen]

New number challenge I made up:

You have a number x. You square it, sort the digits in non-descending order, and remove exactly one digit. The resulting number is 123456. What is the lexicographically smallest x?

What do you mean by lexicographically? Do you mean 1 goes before 19349 goes before 2? Also, by "non-descending", do you mean ascending?

[testitemqlstudop]

What do you mean by lexicographically? Do you mean 1 goes before 19349 goes before 2?

Yes

Also, by "non-descending", do you mean ascending?

No

[testitemqlstudop]

Is

Code: Select all

x = 8, y = 5, rule = B3/S23
2ob2ob2o$2ob2ob2o2$2ob2ob2o$2ob2ob2o!

the smallest unsynthesizable object?

[GUYTU6J]

Is

Code: Select all

x = 8, y = 5, rule = B3/S23
2ob2ob2o$2ob2ob2o2$2ob2ob2o$2ob2ob2o!

the smallest unsynthesizable object?

No, a 6G recipe exists: (source)

Code: Select all

x = 28, y = 19, rule = B3/S23
obo$b2o$bo$10bo$3bobo3bo$3b2o4b3o$4bo$20b2ob2ob2o$20b2ob2ob2o2$20b2ob
2ob2o$20b2ob2ob2o$4bo$3b2o4b3o$3bobo3bo$10bo$bo$b2o$obo!

[BlinkerSpawn]

New number challenge I made up:

You have a number x. You square it, sort the digits in non-descending order, and remove exactly one digit. The resulting number is 123456. What is the lexicographically smallest x?

1112.
"Lexicographical" doesn't mean anything because the number of digits in x is forced to be 4.

[Hdjensofjfnen]

0: The number of False statements is prime
1: All of these statements are false
2: There is a composite number of false statements
3: The number of false statements before this one is prime
4: The number of true statements is prime

0: The number of False statements is prime - TRUE
1: All of these statements are false - FALSE
2: There is a composite number of false statements - FALSE
3: The number of false statements before this one is prime - TRUE
4: The number of true statements is prime - TRUE

Statement 1 cannot be true. If it were true, it would contradict itself. Thus, statement 1 is false, and at least one of 0, 2, 3, 4 must be true.
Now let us look at statement 3. Assume it is true. Then, to satisfy it, one or both of statements 0 and 2 are false. If both 0 and 2 are false, the number of false statements must be 0 or 1, which is a contradiction. Thus, exactly 1 of these two statements are true, and statement 3 is true.
We know now that one of statements 0, 2 is true, and statement 3 is also true. Thus, statement 4 is true, making the number of true statements 3.
Now, we can see easily that statement 2 is false, and statement 0 is thus true.

[testitemqlstudop]

Is

Code: Select all

x = 8, y = 5, rule = B3/S23
2ob2ob2o$2ob2ob2o2$2ob2ob2o$2ob2ob2o!

the smallest unsynthesizable object?

No, a 6G recipe exists: (source)

Code: Select all

x = 28, y = 19, rule = B3/S23
obo$b2o$bo$10bo$3bobo3bo$3b2o4b3o$4bo$20b2ob2ob2o$20b2ob2ob2o2$20b2ob
2ob2o$20b2ob2ob2o$4bo$3b2o4b3o$3bobo3bo$10bo$bo$b2o$obo!

Wow I'm honestly surprised

[Hdjensofjfnen]

Is

Code: Select all

x = 8, y = 5, rule = B3/S23
2ob2ob2o$2ob2ob2o2$2ob2ob2o$2ob2ob2o!

the smallest unsynthesizable object?

No, a 6G recipe exists: (source)

Code: Select all

x = 28, y = 19, rule = B3/S23
obo$b2o$bo$10bo$3bobo3bo$3b2o4b3o$4bo$20b2ob2ob2o$20b2ob2ob2o2$20b2ob
2ob2o$20b2ob2ob2o$4bo$3b2o4b3o$3bobo3bo$10bo$bo$b2o$obo!

The real question is whether this is synthesizable:

Code: Select all

x = 8, y = 8, rule = B3/S23
2ob2ob2o$2ob2ob2o2$2ob2ob2o$2ob2ob2o2$2ob2ob2o$2ob2ob2o!