Hi, I did it in python but only validator 1 is failed althoug the result is good. Can someone give me a hint on why I cannot pass validator 1 ? @Eulero314
here is my Python code:
[Mod edit: please do not post your code here]
Please avoid posting your code on the forum.
Error of your code for validator 1:
IndexError: index 17 is out of bounds for axis 0 with size 17
at Answer.py. in on line 131
sorry for pasting code, thanks for the answer.
However i don’t understand the error as my indexes doesnt go over 16.
could you hint me more?
The console shows that error. That means an index of 17 does show up somehow during the execution of your code. Please check again how that may happen while that is not your intention.
Something’s wrong with the displacement function in your code.
Does anyone happen to know what validator 4 is testing for? All my test cases pass and I’ve tried changing code to get it to pass, but I don’t know what I should be changing.
Similar to Test 4, in Validator 4 there are many movements along the sides and at one of the corners.
Hello, first of all, thank you for this challenge 
Validator 1 & 4 failed with my code : can you say me what are the errors, please ?
We don’t know what the errors are based on what you’ve written 
I’ve mentioned above what Validator 4 looks like. So, I’ll just talk about Validator 1: its input is exactly the same as Test 1, except for one single character.
Thank you, I just found my error and validate all tests 
It’s a very cool challenge 
, I really enjoy it !!
1 Like
Hello !
I’m trying this puzzle, and I don’t understand a part of this. I’m not familiar with “bits considaration” so, I’m lost !
Then, break the 128 bit fingerprint in input into pairs of bits that define 4 possible moves:
00: up-left (North West )
01: up-right (North East)
10: down-left(South West)
11: down-right (South East)
During the 64 steps of the algorithm, the bit pairs are processed byte-wise, from left to right and least significant bits first.
Is there any website which can help me ? I tried to search with Google, but my keywords aren’t good enough…
Thank you !
There are some links at the end of the statement. Do they (especially the third link) help you?
Oh yes, you’re right, I haven’t seen them ! I’ll have a look !
That’s a very interesting topic. I found out how to convert from hexa to bin ! I gonna go further…
As a beginner this took me ages, but I finally figured it out. It’s really cool to not only know how the SSH image is created, but to have re-created it. This exercise improved my skill greatly, in fact more than anything I’ve probably ever done to date, and it’s the first program I’ve written that I feel is well structured, and I wouldn’t be totally embarrassed to show to someone else. I used Go, and for the first time in my life I’m enjoying programming after 25 years of wanting to get good and always struggling and giving up. I’m not looking for a job or anything I’m just a nerd hobbyist. Thank you! On to the next challenge.
3 Likes
I’m having a problem with solving this puzzle in Kotlin as the first line of my output is always: “Java HotSpot™ 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release.”
Can something be done to get rid of it? It leads to all of the tests failing.
Hi I was trying to solve it, everything looks good but my Validator 5 is failing only at one place, can someone please help.
In validator5 the player position moves from (0,1) to (0,0) (1 count) and the bit code for next 24 moves is “00”, which keeps the player in same position and increases the count and takes it to total 25 at (0,0), but the program expects the count to be 24. Not sure where am I getting it wronged.
Any help is appreciated.
“0 0” does appear in the expected output path for 25 times, not 24, and “%” = 10 = 25 mod 15.
Cheers mate! That makes sense, I actually eliminated 0=" " from my special char list and was trying % on the rest, I’ll relook into it!
1 Like
Thanks for introducing an interesting topic in a playful way. After the puzzle I read the attached article about this “Drunken Bishop”. Very entertaining reading, I must say.
1 Like