Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Intersection of 2 sets solution in Clear category for Pawn Brotherhood by kudinov.feodor
def safe_pawns(pawns: set) -> int:
def convert_to_coord(position):
return " abcdefgh".index(position[0]), int(position[1])
converted_pawns = list(map(convert_to_coord, pawns))
possible_moves = []
for pawn in converted_pawns:
possible_moves.extend([(pawn[0] - 1, pawn[1] + 1),
(pawn[0] + 1, pawn[1] + 1)])
return len(set(converted_pawns) & set(possible_moves))
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert safe_pawns({"b4", "d4", "f4", "c3", "e3", "g5", "d2"}) == 6
assert safe_pawns({"b4", "c4", "d4", "e4", "f4", "g4", "e5"}) == 1
print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")
Sept. 9, 2019
Comments:
