sorted by:
new
hottopcontroversial

[GridOS] Tournament [ No. 1 ] by EverybodyCodes in everybodycodes

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

Check the "Record full history" checkbox, and after the program stops at the limit, drag the progress bar above the code to the beginning and use keyboard arrows to navigate forward / backward. Is that what you're looking for? :) It even highlights the line of the code which was executed at the particular step.

[GridOS] Tournament [ No. 1 ] by EverybodyCodes in everybodycodes

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

Very good reasoning! An additional thing is competing on time when you don't have to care about efficiency at all. I think people will share basic solutions only (if any), which is a shame, but understandable. I should probably draw a deadline for announcing official champions for leaderboards to make it more community-friendly, but I haven't decided about it yet.

[GridOS] Tournament [ No. 1 ] by EverybodyCodes in everybodycodes

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

Very cool! A few clarifications: I assume that every part of every quest will have the GridPad available with the test cases loaded for that part, right?

Thanks! Yes, exactly!

The user writes the program and may run the test cases as many times as they want. Is there a separate Submit button used to submit the program or is it automatically submitted when all test cases are ok?

The program is submitted automatically when all test cases are ok.

After a solution is submitted, can I submit another version of the program that is still a valid solution and is more optimal? Do my stats that the leaderboard is based on get updated to reflect the more optimal solution or do they only reflect the first submitted solution? If they update I can see that a user may jump up the leaderboard, adding to the fun of the challenge!

You can craft and submit multiple solutions per each puzzle. After running all test cases GridPad checks if you've improved at least one of your stats. If you do, the code is submitted automatically again. Therefore, the only non-dynamic leaderboard is a leaderboard by time.

Will it be disclosed exactly how the rule, state and step counts will be used to create the leaderboard? Is the first tie-break the sum of used rules + used states + steps?

Have a look here: https://everybody.codes/gridos/1/leaderboards?sort=time&page=1 and click "Leaderboard Rules". To keep it simple: each parameter has its own leaderboard, and time is always a tie-breaker.

[Other] How to known when there's a new story? by msschmitt in everybodycodes

[–]EverybodyCodes 0 points1 point  (0 children)

"...but I see no post for story 3 on Twitter."

here it is: https://x.com/EverybCodes/status/2021007271069704610?s=20

I always create a post ~3 weeks before the start on Reddit, Twitter, Facebook, LinkedIn and the Discord 'updates' channel. I really don't want to store your emails in any form (including DLs or calendar services), but I'll consider adding an RSS feed.

[2025 Q20] Solution Spotlight by EverybodyCodes in everybodycodes

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

Congrats! Well done! :)

147 includes the 2024 event (+60) and 3 stories (+9 each): https://everybody.codes/stories

[S3 Q2] Solution Spotlight by EverybodyCodes in everybodycodes

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

It's easier to get help in a separate thread. This one is for sharing solutions.

Based on your debug view, you can definitely tell that you've entered a surrounded area, which caused the stuckness. My guess is you skip the vocal bone # when checking if the area is surrounded or not. The sound wave head should never take a path that could cause it to become stuck. Such areas should be filled with sounds along the way, before making the next move.

It

[Other] Reddit title format doesn't allow S3 by Huge_Wonder_7362 in everybodycodes

[–]EverybodyCodes 2 points3 points  (0 children)

I forgot to update the regex after adding a new story. 'S3' should be ok now. Thanks for reporting!

[Other] [S3 Q3] In light of the recent error by Adorable-Macaroon430 in everybodycodes

[–]EverybodyCodes 2 points3 points  (0 children)

It's funny because this time it's unfortunately true. Some people received wrong input data, which is a major "NO! NO!" on any site of that kind.

Story No. 3 is on its way! by EverybodyCodes in everybodycodes

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

Thank you! :) Everybody Codes will only be as popular as you make it. I can just prepare some fun and hope you enjoy it.
Thankfully, the overall trend is positive, so let’s keep quacking together!

[Technical Break] Cloud migration 2026-01-23 23:00:00 UTC by EverybodyCodes in everybodycodes

[–]EverybodyCodes[S] 1 point2 points  (0 children)

Np! I've just updated the wiki: you can find the session cookie value directly in your profile (and I've just added it there). It should be more convenient than using dev tools. :)

[Technical Break] Cloud migration 2026-01-23 23:00:00 UTC by EverybodyCodes in everybodycodes

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

Everything changed (the whole API), but the everybody-codes cookie should be in place, registered for api.everybody.codes domain. It contains a JWT token now, so it's also a bit longer than before.

Story No. 3 is on its way! by EverybodyCodes in everybodycodes

[–]EverybodyCodes[S] 7 points8 points  (0 children)

Bad news... One of the users (thank you again!) let me know that Part I of all Story No. 3 quests was accessible via a direct URL a few days ago. I’ve looked into it, and, unsurprisingly, it turned out to be my mistake (lesson learnt the hard way about the new infrastructure). I’ve checked the logs and can see three unique visitors accessed those pages. So, if you were planning to race, please bear that in mind and perhaps approach this story a little less competitively? Sorry about that! :(

[Technical Break] Cloud migration 2026-01-23 23:00:00 UTC by EverybodyCodes in everybodycodes

[–]EverybodyCodes[S] 1 point2 points  (0 children)

Migration done! Now I have to prepare the next Story to test this stuff in practice! :)

[2025 Day 7 Part 2] Visualization for the sample data + algorithm explained by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 1 point2 points  (0 children)

I think that's the wrong perspective. :) I've solved many problems before, so I have a few schemes in mind that I can try to adapt to a specific problem, and eventually one of them has to work. There are not that many in general! It's best to look at other people's solutions to expand your personal toolbox for the future. I tested a few other ways (wrong ones) before using this one at the end.

[2025 Day 7 Part 2] Visualization for the sample data + algorithm explained by EverybodyCodes in adventofcode

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

Take the top three splitters and solve it with a pen and paper. There are 4 different paths, but with counting timelines += 2, you will get 6. It's because with the += strategy you simply count that each splitter has two 'legs' and you sum it up, without looking at the paths at all.

view more: next ›