First clear solution for Pawn Brotherhood by RuiLima - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for Pawn Brotherhood by RuiLima

def wingman_positions(pawn):
    wingman1 = chr(ord(pawn[0]) + 1) + str(int(pawn[1]) - 1)
    wingman2 = chr(ord(pawn[0]) - 1) + str(int(pawn[1]) - 1)
    return (wingman1, wingman2)


def check_wingman(pawns, wingman_position):
    if wingman_position in pawns:
        return True
    else:
        return False
    

def safe_pawns(pawns):
    safe_pawns = 0
    
    for pawn in pawns:
        wingman1, wingman2 = wingman_positions(pawn)
        if check_wingman(pawns, wingman1) or check_wingman(pawns, wingman2):
            safe_pawns += 1

    return safe_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

July 30, 2014

Comments:

MackM on July 30, 2014, 5:47 p.m.
Very easy to follow, nice code.

Cjkjvfnby on Aug. 5, 2014, 10:12 p.m.
No need parenthesis <pre class='brush: python'>#return (wingman1, wingman2) return wingman1, wingman2 </pre> Constructions if (cond) return True else False can be simplified return cond or return bool(cond) You can rewrite check to accept tuple and make both check inside check_wingman(pawns, wingman_positions(pawn))

maurice.makaay on Oct. 28, 2014, 5:14 p.m.
I like the use of the term "wingman" and the function separation a lot. So much even, that I'll forgive the use of chr/ord logic to get the wingmen's positions :-) I dislike that kind of logic, because it results in invalid board positions like "`0", which are no problem for this particular exercise, but which feel like the kind of shortcut that can bite you in production systems.

newbiemiranda on May 6, 2020, 10:23 p.m.
Do we need to define the above 2 functions? def checkwingman(pawns, wingmanposition) and def safe_pawns(pawns). My code is as below, just FYI. Easy for newbie to follow. def safe_pawns(pawns: set) -> int: m = 0 a = list(pawns) for c in a : x = chr(ord(c[0])-1) + str(int(c[1])-1) y = chr(ord(c[0])+1) + str(int(c[1])-1) if x in a or y in a: m += 1 return m

Look up in the Dict()

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!