Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Concise algorithm solution in Speedy category for Pawn Brotherhood by Igor_Sekretarev
def possible_defenders(pawn: str) -> set:
x, y = pawn.encode()
return {chr(x-1)+chr(y-1), chr(x+1)+chr(y-1)}
def safe_pawns(pawns: set) -> int:
return sum(bool(possible_defenders(pawn) & pawns) for pawn in pawns)
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!")
April 24, 2021
