Entanglement - Episode 2

EVENTS

UPCOMING PAST PRIVATE EVENTS

AI GAMES

BOT PROGRAMMING OPTIMIZATION CODE GOLF

ARCADE

PUZZLES CLASH OF CODE CODING ESCAPE

COMMUNITY

LEADERBOARDS CONTRIBUTIONS DISCORD FORUM LIVE STREAMS

Entanglement - Episode 2

Rate this contribution

Make the contribution public (lvl 20+)

The contribution was not moderated in time so the system automatically rejected it.

Comments

8 Comments

CodinBot Unnamed CodinGamer

about 10 months ago

I hope you received enough feedback from the community to improve your contribution. Once you have made the necessary updates, publish your contribution!

yhuberla Unnamed CodinGamer

about 10 months ago

GitHub link is still Entanglement part 1. I would remove 'n' from the input and just use loop 36 in the stub as n is always 36. I am in C++ and I timeout on Combo Breaker Validator too. (Fail-In-Two Validator required_score needs to be changed from 1 to 2. But I believe it's a temporary test case you placed after Timinator's message.)

Timinator Unnamed CodinGamer

about 10 months ago

Is the first test case legit yet? It seems kind of hard for a 1st test case, so I thought I should ask before I put too much time into it. UPDATE: I have solved test case 1. I still need to ask my question above since it seems fairly involved for a first test case and I don't understand the title: Fail-In-One. UPDATE 2: It looks like the name relates to how quickly the test case fails if there are no rotations. Fail-In-Two Validator required_score needs to be changed to 331 FYI: I'm doing brute force (except for stopping when required_score is found) with Python and the only test case I time out on is 10: Combo Breaker Validator.

VizGhar Unnamed CodinGamer

about 10 months ago

Names are copied from part 1. I believe all testcases are legit. But I have zero time to complete this puzzle, so it will stay like this for some time :( You are supposed to solve part 1 before starting this one, so first testcases can be harder (rotations and path following should be resolved by this time). This puzzle should be solved by bruteforcing. Part 3 (if I make one) won't be bruteforceable. I'll make a few testcases such that you are supposed to rotate just a single tile at the beggining/end of sequence to make first testcases easier.

5DN1L Unnamed CodinGamer

about 11 months ago

Gameplay * Please change "a not-visited" to "an unvisited". * Please add ", each step equal to 60°" after "counter-clockwise steps". Scoring * Please change "marking the tile" to "rotating the tile directly ahead and marking it". Coordinate system * Please change "all cells" to "all 36 non-center cells". * Please change "each tile" to "the tile on each cell". Initial input * Next n lines: Please change "configuration" to "coordinates and entrances". * Example: Please add "the illustrated example" before "in the Rules section". Your task / Initial input / Turn output * It's confusing to use the word "rotations" to describe both: • the maximum number of rotation actions allowed per game, and • the number of counter-clockwise rotations applied to a tile. To avoid this ambiguity, I would suggest: • Your task / Initial input: Instead of "maximum allowed tile rotations per game", use "maximum number of tiles that can be rotated per game". • Turn output: Remove the note. Instead, provide the examples under "Your task". Constraints * Should the lower limit of `max_rotations` be 1 instead of 0? Cases, referee, error messages, etc. * To be reviewed later. Thanks.

VizGhar Unnamed CodinGamer

about 11 months ago

TODOs: - tile rotations are a bit off - testcases - adjust constraints

ABOUT US CAREERS PRIVACY FAQ BLOG

The #1 tech hiring platform

SCREENING INTERVIEWING