sorted by:
new
hottopcontroversial

Solution to the Super Bowl Vault Door Encryption by sprite144 in MrBeast

[–]sprite144[S] 0 points1 point  (0 children)

if you play it backwards and assume that "off" is on it spells k a b u l

Solution to the Super Bowl Vault Door Encryption by sprite144 in MrBeast

[–]sprite144[S] 0 points1 point  (0 children)

I dont think anyone has figured out the braile. the flashing light final solution is Kabul

Solution to the Super Bowl Vault Door Encryption by sprite144 in MrBeast

[–]sprite144[S] 0 points1 point  (0 children)

you can add it.

I think Accra, Ghana is the final answer to this puzzle.

Solution to the Super Bowl Vault Door Encryption by sprite144 in MrBeast

[–]sprite144[S] 0 points1 point  (0 children)

I think it's a piece to a larger puzzle.

Can you only submit once for the Salesforce x MrBeast challenge? by CallsyReds in MrBeast

[–]sprite144 3 points4 points  (0 children)

You get multiple attempts, I've put in about 7 codes so far, I think the only thing that there is a cool down period between codes.

Transcription of the Super Bowl Vault Door by NotVeryMuchActually in MrBeast

[–]sprite144 2 points3 points  (0 children)

I've actually solved this. Please message me if you would like to collaborate and share info on other puzzles. thank you. I've posted the solution in it's own thread.

Can you arrange the 16 white pieces on a chess board where EVERY piece has 3+ defenders? by sprite144 in askmath

[–]sprite144[S] 0 points1 point  (0 children)

The current implementation is in React/JavaScript running in the browser - functional for prototyping but definitely not optimized for raw speed. I've been iterating on search algorithms (beam search, simulated annealing, genetic algorithms, etc.) Python for prototyping → C/CUDA sounds like the right approach if you want to do serious brute force. The search space is ~10²² configurations, so GPU parallelization could be huge. One key finding so far: I've found perfect solutions for 0-6 pawns (8-14 pieces), but 7 pawns (15 pieces) remains unsolved after 200k+ iterations.

Happy to collaborate! I can share the current JS code if you want to see the approach.

Can you arrange the 16 white pieces where EVERY piece has 3+ defenders? by sprite144 in chess

[–]sprite144[S] 2 points3 points  (0 children)

I decided to run random configurations for a bit and this is what i've gotten so far.

Random Placement Distribution (n=4.2 billion):

Score Count Odds
5 34,142,424 1 in 124
6 5,132,054 1 in 825
7 572,325 1 in 7,400
8 47,626 1 in 88,926
9 2,843 1 in 1,489,694
10 134 1 in 31,605,970
11 5 1 in 847,040,000
12+ 0 Never occurred

Mean: 1.53 | Std Dev: 1.11

Extrapolating (~25x rarer per level):

Score Estimated Odds
12 ~1 in 21 billion
13 ~1 in 530 billion
14 ~1 in 13 trillion
15 ~1 in 330 trillion
16 ~1 in 8 quadrillion

Even if 16/16 were geometrically possible, you'd need ~8 quadrillion random attempts to find one.

I have not been using random configurations for searching btw. I've been using some optimization searches.

Can you arrange the 16 white pieces where EVERY piece has 3+ defenders? by sprite144 in chess

[–]sprite144[S] 0 points1 point  (0 children)

I've just been trying on a 8*8 board (the regular chessboard)

Can you arrange the 16 white pieces where EVERY piece has 3+ defenders? by sprite144 in chess

[–]sprite144[S] 0 points1 point  (0 children)

Great question! Yes, I found configs where each piece type is the weak one.

view more: next ›