[Community Puzzle] Moves in maze

Puzzles
#1

Coding Games and Programming Challenges to Code Better

Send your feedback or ask for help here!

Created by @Remi,validated by @Westicles,@b0n5a1 and @FredericLocquet.
If you have any issues, feel free to ping them.

1 Like
#2

Hi,
all tests ok, validator 3 is not good. What’s the diffrence with tests 3, please ?
Thx for the puzzle
Rems

#3

Send me your code in private, I’ll send back the error.

#4

Hey ^^

Almost same as @RRRoumy but only validator 6 is incorrect. Code by PM too ?

#5

Of course.

#6

In the validator 3, the starting position is on a border, not in test 3. It can be a difference.
For the validator 6, there is no obvious difference with test 6, so i don’t know where can be the bug.

3 Likes
#7

It was a timeout with my PHP code. A bit of optimisation solved the issue. ^^

#9

Hi, I am getting test 4 and test 6 wrong (not validators), it’s hard to see whats wrong so I thought I’d ask here.

pretty sure if I solve test 4’s issue I’ll get test 6 right, so here is what my code outputs for test 4:

654567899876545
765678#AA987656
676789ABBA98767
56789ABCCBA9876
456789ABBA98765
3456789AA987#54
234567899876#43
123456788765432
012345677654321
1#3456788765432

By a quick glance it looks like my code is getting only the first 3 lines wrong.

#10

I think you’ve missed this in the statement:

The maze is periodic: if you go left you appear on the right if there is no wall, and vice versa, similarly with up/down.

1 Like
#11

Is this the same case as:

7
6
5
#
8

where 8 is at the end because there is no wall stopping 7. If so, I did cover it in my code

#12

Your top left value is 6 but your bottom left value is 1?

1 Like
#13

oh, I see now. so 5DN1L was right, my implementation may be wrong, I’ll look into it. Thanks.

#15

Looking at my own code, the biggest What The Heck in all of it is… try guessing… yes, the modulo operator! I had to implement my own modulo because Kotlin unlike say Python, does not implement a proper mathematical mod operator. Did you guys struggle with this too?

#16

Hello everyone !
So bumped in this kind of issue:
Found:
23456789A876543
Expected:
234567899876543

4th test I have one letter error, it’s A instead of 9

Did try to change the direction order, doesn’t seem to help as it’s all done in a recursive loop.

Anyone had this kind of issue ?

#17

I don’t know your algorithm, but you can see that if you come from right, You have to obtain a 9 after an 8.

#18

Yes of course. But the thing is the maze is periodic, so it basically comes both ways left and right. So in my solution left side is developing faster since 2 is on the left, so I have 9 and then A. And on the right I have just 8. I can drop you the code if you like. But hopefully you understand my point.

#19

Merci beaucoup. Il s’avere que ma queue etait mauvaise. Ça marche maintenant !

#20

Hi,
I’ve been stuck in case #4 - #6 for several hours now and I can’t seem to find what’s wrong or missing in my code, I’d appreciate if someone could point me in the right direction.
This is what I get for case #4 - “space” dataset:

Output
23456789A876543
345678#AB987654
456789ABCA98765
56789ABCDBA9876
456789ABCA98765
3456789AB987#54
23456789A876#43
123456789765432
012345678654321
1#3456789765432

Failure
Found: 23456789A876543
Expected: 234567899876543

I’ve tried altering the order of neighbors with all possible permutations and the output changes but I’m unable to get the expected output for these cases. I’ve also tried implementing a cost function to try to influence the order in which nodes are visited but still not working.

#21

It’s exactly the same error as @franca1s … he said his queue was bad.

#22

Yes, I solved it by filtering wrong directions. So basically as soon as I find the next letter in the sequence, I move on. I guess it wouldn’t work if there were incomplete sequences with dead ends. But that’s enough for the test cases.