Pawn Brotherhood

Qesestion:

Almost everyone in the world knows about the ancient game Chess and has at least a basic understanding of its rules. It has various units with a wide range of movement patterns allowing for a huge number of possible different game positions (for example Number of possible chess games at the end of the n-th plies.) For this mission, we will examine the movements and behavior of chess pawns.

Chess is a two-player strategy game played on a checkered game board laid out in eight rows (called ranks and denoted with numbers 1 to 8) and eight columns (called files and denoted with letters a to h) of squares. Each square of the chessboard is identified by a unique coordinate pair — a letter and a number (ex, "a1", "h8", "d6"). For this mission we only need to concern ourselves with pawns. A pawn may capture an opponent's piece on a square diagonally in front of it on an adjacent file, by moving to that square. For white pawns the front squares are squares with greater row number than the square they currently occupy.

A pawn is generally a weak unit, but we have 8 of them which we can use to build a pawn defense wall. With this strategy, one pawn defends the others. A pawn is safe if another pawn can capture a unit on that square. We have several white pawns on the chess board and only white pawns. You should design your code to find how many pawns are safe.

Input: Placed pawns coordinates as a set of strings.

Output: The number of safe pawns as a integer.

Example:

safe_pawns({"b4", "d4", "f4", "c3", "e3", "g5", "d2"}) == 6

safe_pawns({"b4", "c4", "d4", "e4", "f4", "g4", "e5"}) == 1

code:

def safe_pawns(pawns: set) -> int:
    count = 0
	for i in pawns:
		if chr(ord(i[0])+1) + str(int(i[1])-1) in pawns:
			count += 1
		elif chr(ord(i[0])-1) + str(int(i[1])-1) in pawns:
			count += 1
    return count

总结：

ord():返回单个字符的ASCII值（0-255）

chr():输入一个整数（0-255），返回其对应的编码值