Skip to content

Instantly share code, notes, and snippets.

@sanan-fataliyev

sanan-fataliyev/dont-get-volunteered.py

Created April 7, 2021 00:56
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save sanan-fataliyev/dc12ff764322f08052e378a1b77804d5 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save sanan-fataliyev/dc12ff764322f08052e378a1b77804d5 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
dont-get-volunteered.py
"""
Don't Get Volunteered!
======================
As a henchman on Commander Lambda's space station, you're expected to be resourceful, smart, and a quick thinker. It's not easy building a doomsday device and ordering the bunnies around at the same time, after all! In order to make sure that everyone is sufficiently quick-witted, Commander Lambda has installed new flooring outside the henchman dormitories. It looks like a chessboard, and every morning and evening you have to solve a new movement puzzle in order to cross the floor. That would be fine if you got to be the rook or the queen, but instead, you have to be the knight. Worse, if you take too much time solving the puzzle, you get "volunteered" as a test subject for the LAMBCHOP doomsday device!
To help yourself get to and from your bunk every day, write a function called solution(src, dest) which takes in two parameters: the source square, on which you start, and the destination square, which is where you need to land to solve the puzzle. The function should return an integer representing the smallest number of moves it will take for you to travel from the source square to the destination square using a chess knight's moves (that is, two squares in any direction immediately followed by one square perpendicular to that direction, or vice versa, in an "L" shape). Both the source and destination squares will be an integer between 0 and 63, inclusive, and are numbered like the example chessboard below:
-------------------------
| 0| 1| 2| 3| 4| 5| 6| 7|
-------------------------
| 8| 9|10|11|12|13|14|15|
-------------------------
|16|17|18|19|20|21|22|23|
-------------------------
|24|25|26|27|28|29|30|31|
-------------------------
|32|33|34|35|36|37|38|39|
-------------------------
|40|41|42|43|44|45|46|47|
-------------------------
|48|49|50|51|52|53|54|55|
-------------------------
|56|57|58|59|60|61|62|63|
-------------------------
Languages
=========
To provide a Python solution, edit solution.py
To provide a Java solution, edit Solution.java
Test cases
==========
Your code should pass the following test cases.
Note that it may also be run against hidden test cases not shown here.
-- Python cases --
Input:
solution.solution(0, 1)
Output:
3
Input:
solution.solution(19, 36)
Output:
1
-- Java cases --
Input:
Solution.solution(19, 36)
Output:
1
Input:
Solution.solution(0, 1)
Output:
3
"""
def solution(src, target):
visited = [False] * 64
visited[src] = True
moves = (
(1, 2),
(1, -2),
(2, 1),
(2, -1),
(-1, 2),
(-1, -2),
(-2, 1),
(-2, -1)
)
q = [src]
counts = [0] * (8 * 8)
counts[src] = 0
while q:
loc = q.pop(0)
if loc == target:
return counts[loc]
row, col = divmod(loc, 8)
for d_row, d_col in moves:
if 0 <= row + d_row < 8 and 0 <= col + d_col < 8:
dst = loc + (d_row * 8) + d_col
if 0 <= dst < 8 * 8 and not visited[dst]:
visited[dst] = True
counts[dst] = counts[loc] + 1
q.append(dst)
return counts[target]
if __name__ == '__main__':
tests = [
((0, 1), 3),
((19, 36), 1),
]
for (src, target), want in tests:
got = solution(src, target)
if got != want:
print(f"FAIL: ({(src, target)}): {want=}, {got=}")
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment