First clear solution for Pawn Brotherhood by Pouf - 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 Pouf

def safe_pawns(pawns):
    
    safePawns = 0
    
    for pawn in pawns:
        col = pawn[0]
        row = pawn[1]
        
        defenseRow = str(int(row)-1)
        defenseLeft = chr(ord(col)-1) + defenseRow
        defenseRight = chr(ord(col)+1) + defenseRow
        
        if defenseLeft in pawns or defenseRight in pawns:
            safePawns += 1
            
    return safePawns

Oct. 24, 2014

Comments:

Quartic on Nov. 23, 2014, 7:37 p.m.
Instead of: <pre class='brush: python'>for pawn in pawns: col = pawn[0] row = pawn[1] </pre> you can do: <pre class='brush: python'>for col, row in pawns: </pre>

Pouf on Nov. 26, 2014, 2:40 p.m.
Indeed ! Thank you, I didn't know this.

danny.luker_6f2b7a7a6c6340b297 on Jan. 11, 2017, 6:24 p.m.
Good tip!

mikmiker on Nov. 24, 2014, 3:59 a.m.
Very readable and clear, thanks.

Pouf on Dec. 9, 2014, 3:13 p.m.
my pleasure :)

ArtemMuterko on March 30, 2015, 3:45 p.m.
That is great and truly Pythonic. Immediately clear what author tried to achieve

lightninng on May 18, 2015, 2:45 a.m.
So clear it is ,superior to other solutions

Pouf on May 21, 2015, 7:21 a.m.
Thanks ! And don't forget to vote :p

Sedfer on Oct. 29, 2015, 6:59 p.m.
Realy good and clear solution, unlike many others

weatherpattern on Sept. 15, 2016, 4:49 p.m.
Great solution,simple and clear. Also your strategy to convert to string to do the conditional was very clever.

splut on Sept. 20, 2016, 9:01 p.m.
Very clear and nice to look at

jannidis on Oct. 8, 2016, 7:33 p.m.
Even if it is a bit longer than other solutions it is especially readable and clear. Really like it. Still not too happy about the chr/ord combinations. Maybe it is worthwhile to change the data structure of the positions for once at the beginning like this?: <pre class='brush: python'>def safe_pawns(pawns): positions = [(ord(i)-96,int(j)) for i,j in pawns] safePawns = 0 for col, row in positions: defenseLeft = (col-1, row-1) defenseRight = (col+1, row-1) if defenseLeft in positions or defenseRight in positions: safePawns += 1 return safePawns </pre>

Pouf on Oct. 8, 2016, 7:58 p.m.
Thank you and I love your idea ! Even now, I usually deal with the cards I am given when I should take a step back :)

CamRodriguez on Jan. 12, 2017, 8:31 p.m.
This is the clearest I've seen.

valor on March 3, 2017, 10:31 a.m.
Very clean and readable solution. Thank You!

w72er on Feb. 1, 2023, 1:54 p.m.
I think that is the clearest and fastest solution. There are no useless constructions, code is splitted on logical block.

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!