Move History

Rooted by: Knight moves in 3 dimentions
Fork Selected
  • Code 
    def knight_move3d(pos=(0, 0, 0)) -> bool:
    if pos == (0, 0, 0):
        return True
    return [*sorted(map(abs, pos))] == [0, 1, 2]
     Test Cases 
    import codewars_test as test
from solution import knight_move3d
import random

@test.describe("Example")
def test_group():
    @test.it("test case")
    def test_case():
        test.assert_equals(knight_move3d((0,0,0)),True)
        test.assert_equals(knight_move3d((0,-2,1)),True)
        test.assert_equals(knight_move3d((0,-2,-1)),True)        
        test.assert_equals(knight_move3d((0,2,1)),True)
        test.assert_equals(knight_move3d((0,1,2)),True)
        test.assert_equals(knight_move3d((1,2,0)),True)
        test.assert_equals(knight_move3d((-1,2,0)),True)
        test.assert_equals(knight_move3d((1,-2,0)),True)
        test.assert_equals(knight_move3d((-1,-2,0)),True)
        test.assert_equals(knight_move3d((1,0,2)),True)
        test.assert_equals(knight_move3d((1,0,-2)),True)
        test.assert_equals(knight_move3d((-1,0,-2)),True)
        test.assert_equals(knight_move3d((-1,-2,0)),True)
        test.assert_equals(knight_move3d((2,0,1)),True)
        test.assert_equals(knight_move3d((2,0,-1)),True)
        test.assert_equals(knight_move3d((-2,1,0)),True)        
        test.assert_equals(knight_move3d((-2,0,-1)),True)       
        test.assert_equals(knight_move3d((-2,0,1)),True)
        
        
    @test.it("test case")
    def test_case():  
        test.assert_equals(knight_move3d((1,1,1)),False)
        test.assert_equals(knight_move3d((-1,1,2)),False)
        test.assert_equals(knight_move3d((7,7,6)),False)
        test.assert_equals(knight_move3d((0,0,1)),False)
    View Run Output
  • Code
    • def knight_move3d(position=(0, 0, 0)) -> bool:
    • if position == (0, 0, 0):
    • def knight_move3d(pos=(0, 0, 0)) -> bool:
    • if pos == (0, 0, 0):
    • return True
    • _sum: int = 0
    • mul: int = 1
    • for i in position:
    • if i > 2 or -2 > i:
    • return False
    • _sum += abs(i)
    • mul = mul * i
    • return _sum == 3 and mul == 0
    • return [*sorted(map(abs, pos))] == [0, 1, 2]