######################################################################## # JeffProd Simple Python Chess Program ######################################################################## # AUTHOR : Jean-Francois GAZET # WEB : http://www.jeffprod.com # TWITTER : @JeffProd # MAIL : jeffgazet@gmail.com # LICENCE : GNU GENERAL PUBLIC LICENSE Version 2, June 1991 ######################################################################## from piece import * import os # for clear ou cls class Board: "The chess board" # Names of the 64 sqares coord=[ 'a8','b8','c8','d8','e8','f8','g8','h8', 'a7','b7','c7','d7','e7','f7','g7','h7', 'a6','b6','c6','d6','e6','f6','g6','h6', 'a5','b5','c5','d5','e5','f5','g5','h5', 'a4','b4','c4','d4','e4','f4','g4','h4', 'a3','b3','c3','d3','e3','f3','g3','h3', 'a2','b2','c2','d2','e2','f2','g2','h2', 'a1','b1','c1','d1','e1','f1','g1','h1', ] #################################################################### def __init__(self): self.init() #################################################################### def init(self): "Init the chess board at starting position" # Chessboard has 64 squares, numbered from 0 to 63 (a8 to h1) # Placing pieces ('cases' is 'square' in french :) self.cases = [ Piece('TOUR','noir'),Piece('CAVALIER','noir'),Piece('FOU','noir'),Piece('DAME','noir'),Piece('ROI','noir'),Piece('FOU','noir'),Piece('CAVALIER','noir'),Piece('TOUR','noir'), Piece('PION','noir'),Piece('PION','noir'),Piece('PION','noir'),Piece('PION','noir'),Piece('PION','noir'),Piece('PION','noir'),Piece('PION','noir'),Piece('PION','noir'), Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(), Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(), Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(), Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(),Piece(), Piece('PION','blanc'),Piece('PION','blanc'),Piece('PION','blanc'),Piece('PION','blanc'),Piece('PION','blanc'),Piece('PION','blanc'),Piece('PION','blanc'),Piece('PION','blanc'), Piece('TOUR','blanc'),Piece('CAVALIER','blanc'),Piece('FOU','blanc'),Piece('DAME','blanc'),Piece('ROI','blanc'),Piece('FOU','blanc'),Piece('CAVALIER','blanc'),Piece('TOUR','blanc') ] self.side2move='blanc' self.ep=-1 # the number of the square where to take 'en pasant' self.history=[] # the moves history self.ply=0 # half-move number since the start # Castle rights self.white_can_castle_56=True self.white_can_castle_63=True self.black_can_castle_0=True self.black_can_castle_7=True #################################################################### def gen_moves_list(self,color='',dontCallIsAttacked=False): """Returns all possible moves for the requested color. If color is not given, it is considered as the side to move. dontCallIsAttacked is a boolean flag to avoid recursive calls, due to the actually wrotten is_attacked() function calling this gen_moves_list() function. A move is defined as it : - the number of the starting square (pos1) - the number of the destination square (pos2) - the name of the piece to promote '','q','r','b','n' (queen, rook, bishop, knight) """ if(color==''): color=self.side2move mList=[] # For each 'piece' on the board (pos1 = 0 to 63) for pos1,piece in enumerate(self.cases): # Piece (or empty square) color is not the wanted ? pass if piece.couleur!=color: continue if(piece.nom=='ROI'): # KING mList+=piece.pos2_roi(pos1,self.oppColor(color),self,dontCallIsAttacked) continue elif(piece.nom=='DAME'): # QUEEN = ROOK + BISHOP moves ! mList+=piece.pos2_tour(pos1,self.oppColor(color),self) mList+=piece.pos2_fou(pos1,self.oppColor(color),self) continue elif(piece.nom=='TOUR'): # ROOK mList+=piece.pos2_tour(pos1,self.oppColor(color),self) continue elif(piece.nom=='CAVALIER'): # KNIGHT mList+=piece.pos2_cavalier(pos1,self.oppColor(color),self) continue elif(piece.nom=='FOU'): # BISHOP mList+=piece.pos2_fou(pos1,self.oppColor(color),self) continue if(piece.nom=='PION'): # PAWN mList+=piece.pos2_pion(pos1,piece.couleur,self) continue return mList #################################################################### def setboard(self,fen): """Set the board to the FEN position given. i.e. : rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - - 0 Returns TRUE or FALSE if done or not. If not : print errors. """ f=fen.split() err="" if(len(f)!=6): err+="Wrong FEN notation. It should be :\n" err+="[pieces] [side to move] [castle rights] [ep] [plys] [move number]\n" err+="i.e. : rnbqkbnr/pppppppp/8/8/4P3/8/PPPP1PPP/RNBQKBNR b KQkq e3 0 1\n" print(err) return False self.init() self.white_can_castle_56=False self.white_can_castle_63=False self.black_can_castle_0=False self.black_can_castle_7=False fen = f[0] # rnbqkbnr/pppppppp/8/8/4P3/8/PPPP1PPP/RNBQKBNR trait = f[1] # b ou w (black,white) roque = f[2] # KQkq ep = f[3] # e3 rule50= f[4] # 0 (half-moves since start of game for 50 moves rule) num = f[5] # move number # Setting pieces i=0 for c in fen: if(c=='k'): self.cases[i]=Piece('ROI','noir') i=i+1 elif(c=='q'): self.cases[i]=Piece('DAME','noir') i=i+1 elif(c=='r'): self.cases[i]=Piece('TOUR','noir') i=i+1 elif(c=='n'): self.cases[i]=Piece('CAVALIER','noir') i=i+1 elif(c=='b'): self.cases[i]=Piece('FOU','noir') i=i+1 elif(c=='p'): self.cases[i]=Piece('PION','noir') i=i+1 elif(c=='K'): self.cases[i]=Piece('ROI','blanc') i=i+1 elif(c=='Q'): self.cases[i]=Piece('DAME','blanc') i=i+1 elif(c=='R'): self.cases[i]=Piece('TOUR','blanc') i=i+1 elif(c=='N'): self.cases[i]=Piece('CAVALIER','blanc') i=i+1 elif(c=='B'): self.cases[i]=Piece('FOU','blanc') i=i+1 elif(c=='P'): self.cases[i]=Piece('PION','blanc') i=i+1 elif(c=='/'): pass else: # a number of empty squares is given try: nb=int(c) except ValueError: print('Error : wrong FEN. Integer expected.') return cpt=0 while(cpt0): s+=str(emptySq) emptySq=0 s+='/' if(piece.isEmpty()): emptySq+=1 elif(p=='ROI'): if(emptySq>0): s+=str(emptySq) emptySq=0 if(c=='noir'): s+='k' else: s+='K' elif(p=='DAME'): if(emptySq>0): s+=str(emptySq) emptySq=0 if(c=='noir'): s+='q' else: s+='Q' elif(p=='TOUR'): if(emptySq>0): s+=str(emptySq) emptySq=0 if(c=='noir'): s+='r' else: s+='R' elif(p=='CAVALIER'): if(emptySq>0): s+=str(emptySq) emptySq=0 if(c=='noir'): s+='n' else: s+='N' elif(p=='FOU'): if(emptySq>0): s+=str(emptySq) emptySq=0 if(c=='noir'): s+='b' else: s+='B' elif(p=='PION'): if(emptySq>0): s+=str(emptySq) emptySq=0 if(c=='noir'): s+='p' else: s+='P' if(emptySq>0): s+=str(emptySq) # b or w (black,white) if(self.side2move=='blanc'): s+=' w ' else: s+=' b ' # Castle rights (KQkq) no_castle_right=True if(self.white_can_castle_63): s+='K' no_castle_right=False if(self.white_can_castle_56): s+='Q' no_castle_right=False if(self.black_can_castle_7): s+='k' no_castle_right=False if(self.black_can_castle_0): s+='q' no_castle_right=False if(no_castle_right): s+='-' # prise en passant e3 if(self.ep!=-1): s+=' '+self.coord[self.ep] else: s+=' -' # TODO # number of half-moves for 50 moves rule s+=' -' # numéro du coup s+=' '+str(int(len(self.history)/2)) return s #################################################################### def domove(self,depart,arrivee,promote): """Move a piece on the board from the square numbers 'depart' to 'arrivee' (0..63) respecting rules : - prise en passant - promote and under-promote - castle rights Returns : - TRUE if the move do not let king in check - FALSE otherwise and undomove is done. """ # Debugging tests #if(self.cases[depart].isEmpty()): # print('domove() ERROR : asked for an empty square move : ',depart,arrivee,promote) # return #if(int(depart)<0 or int(depart)>63): # print('domove() ERROR : incorrect FROM square number : ',depart) # return #if(int(arrivee)<0 or int(arrivee)>63): # print('domove() ERROR : incorrect TO square number : ',arrivee) # return #if(not(promote=='' or promote=='q' or promote=='r' or promote=='n' or promote=='b')): # print('domove() ERROR : incorrect promote : ',promote) # return # Informations to save in the history moves pieceDeplacee=self.cases[depart] # moved piece piecePrise=self.cases[arrivee] # taken piece, can be null : Piece() isEp=False # will be used to undo a ep move histEp=self.ep # saving the actual ep square (-1 or square number TO) hist_roque_56=self.white_can_castle_56 hist_roque_63=self.white_can_castle_63 hist_roque_0=self.black_can_castle_0 hist_roque_7=self.black_can_castle_7 flagViderEp=True # flag to erase ep or not : if the pawn moved is not taken directly, it can't be taken later # Moving piece self.cases[arrivee]=self.cases[depart] self.cases[depart]=Piece() self.ply+=1 # a PAWN has been moved ------------------------------------- if(pieceDeplacee.nom=='PION'): # White PAWN if(pieceDeplacee.couleur=='blanc'): # If the move is "en passant" if(self.ep==arrivee): piecePrise=self.cases[arrivee+8] # take black pawn self.cases[arrivee+8]=Piece() isEp=True # The white pawn moves 2 squares from starting square # then blacks can take "en passant" next move elif(self.ROW(depart)==6 and self.ROW(arrivee)==4): self.ep=arrivee+8 flagViderEp=False # Black PAWN else: if(self.ep==arrivee): piecePrise=self.cases[arrivee-8] self.cases[arrivee-8]=Piece() isEp=True elif(self.ROW(depart)==1 and self.ROW(arrivee)==3): self.ep=arrivee-8 flagViderEp=False # a ROOK has been moved-------------------------------------- # update castle rights elif(pieceDeplacee.nom=='TOUR'): # White ROOK if(pieceDeplacee.couleur=='blanc'): if(depart==56): self.white_can_castle_56=False elif(depart==63): self.white_can_castle_63=False # Black ROOK else: if(depart==0): self.black_can_castle_0=False elif(depart==7): self.black_can_castle_7=False # a KING has been moved----------------------------------------- elif(pieceDeplacee.nom=='ROI'): # White KING if(pieceDeplacee.couleur=='blanc'): # moving from starting square if(depart==60): # update castle rights self.white_can_castle_56=False self.white_can_castle_63=False # If castling, move the rook if(arrivee==58): self.cases[56]=Piece() self.cases[59]=Piece('TOUR','blanc') elif(arrivee==62): self.cases[63]=Piece() self.cases[61]=Piece('TOUR','blanc') # Black KING else: if(depart==4): self.black_can_castle_0=False self.black_can_castle_7=False if(arrivee==6): self.cases[7]=Piece() self.cases[5]=Piece('TOUR','noir') elif(arrivee==2): self.cases[0]=Piece() self.cases[3]=Piece('TOUR','noir') # End pieces cases----------------------------------------------- # Any move cancels the ep move if(flagViderEp==True): self.ep=-1 # Promote : the pawn is changed to requested piece if(promote!=''): if(promote=='q'): self.cases[arrivee]=Piece('DAME',self.side2move) elif(promote=='r'): self.cases[arrivee]=Piece('TOUR',self.side2move) elif(promote=='n'): self.cases[arrivee]=Piece('CAVALIER',self.side2move) elif(promote=='b'): self.cases[arrivee]=Piece('FOU',self.side2move) # Change side to move self.changeTrait() # Save move to the history list self.history.append((depart,\ arrivee,\ pieceDeplacee,\ piecePrise,\ isEp,\ histEp,\ promote,\ hist_roque_56,\ hist_roque_63,\ hist_roque_0,\ hist_roque_7)) # If the move lets king in check, undo it and return false if(self.in_check(self.oppColor(self.side2move))): self.undomove() return False return True #################################################################### def undomove(self): "Undo the last move in history" if(len(self.history)==0): print('No move played') return # The last move in history is : self.historique[-1] lastmove=self.history[-1] pos1=lastmove[0] pos2=lastmove[1] piece_deplacee=lastmove[2] piece_prise=lastmove[3] isEp=lastmove[4] ep=lastmove[5] promote=lastmove[6] self.white_can_castle_56=lastmove[7] self.white_can_castle_63=lastmove[8] self.black_can_castle_0=lastmove[9] self.black_can_castle_7 =lastmove[10] self.ply-=1 # Change side to move self.changeTrait() # Replacing piece on square number 'pos1' self.cases[pos1]=self.cases[pos2] # Square where we can take "en pasant" self.ep=ep # If undoing a promote, the piece was a pawn if(promote!=''): self.cases[pos1]=Piece('PION',self.side2move) # Replacing capture piece on square 'pos2' self.cases[pos2]=piece_prise # Switch the piece we have replaced to 'pos1'------------------- if(self.cases[pos1].nom=='PION'): # If a pawn has been taken "en passant", replace it if(isEp): self.cases[pos2]=Piece() if(self.cases[pos1].couleur=='noir'): self.cases[pos2-8]=Piece('PION','blanc') else: self.cases[pos2+8]=Piece('PION','noir') # Replacing KING ----------------------------------------------- elif(self.cases[pos1].nom=='ROI'): # White KING if(self.cases[pos1].couleur=='blanc'): # Replacing on initial square if(pos1==60): # If the move was castle, replace ROOK if(pos2==58): self.cases[56]=Piece('TOUR','blanc') self.cases[59]=Piece() elif(pos2==62): self.cases[63]=Piece('TOUR','blanc') self.cases[61]=Piece() # Black KING else: if(pos1==4): if(pos2==2): self.cases[0]=Piece('TOUR','noir') self.cases[3]=Piece() elif(pos2==6): self.cases[7]=Piece('TOUR','noir') self.cases[5]=Piece() # End switch piece---------------------------------------------- # Delete the last move from history self.history.pop() #################################################################### def changeTrait(self): "Change the side to move" if(self.side2move=='blanc'): self.side2move='noir' else: self.side2move='blanc' #################################################################### def oppColor(self,c): "Returns the opposite color of the 'c' color given" if(c=='blanc'): return 'noir' else: return 'blanc' #################################################################### def in_check(self,couleur): """Returns TRUE or FALSE if the KING of the given 'color' is in check""" # Looking for the id square where is the king # sure, we can code better to avoid this and win kn/s... for i in range(0,64): if(self.cases[i].nom=='ROI' and self.cases[i].couleur==couleur): pos=i break return self.is_attacked(pos,self.oppColor(couleur)) #################################################################### def is_attacked(self,pos,couleur): """Returns TRUE or FALSE if the square number 'pos' is a destination square for the color 'couleur'. If so we can say that 'pos' is attacked by this side. This function is used for 'in check' and for castle moves.""" mList=self.gen_moves_list(couleur,True) for pos1,pos2,promote in mList: if(pos2==pos): return True return False #################################################################### def render(self): "Display the chessboard in console mode" input("\nType a key to continue...") os.system('cls' if os.name == 'nt' else 'clear') print('') print('=> Commands are :') print('- "new" for a new game') print('- "e2e4" for example, to move a piece') print('- "e7e8q" for a promote move to queen ("r" for rook, "n" for knight, "b" for bishop)') print('- "legalmoves" show legal moves for side to move') print('- "undomove" to cancel the last move') print('- "go" asks the engine to play now') print('- "setboard [fen]" to set the board as the FEN notation given') print('- "getboard" to export the current FEN board position') print('- "sd [x]" to set the depth search') print('- "perft [x]" : test the move generator (x = search depth)') print('- "quit"... to quit') print('') print('8',end=' ') i,y=1,7 for piece in self.cases: if(piece.couleur=='noir'): print(piece.nom[0].lower(),end=' ') else: print(piece.nom[0],end=' ') if(i%8==0): print() print() if(y>0): print(str(y),end=' ') y=y-1 i+=1 print(' a b c d e f g h') print('Side to move : '+self.side2move) if(self.ep!=-1): print('"en passant" possible in',self.coord[self.ep]) # Displaying castle rights no_castle_right=True print('Castle rights : ',end='') if(self.white_can_castle_63): print('K',end='') no_castle_right=False if(self.white_can_castle_56): print('Q',end='') no_castle_right=False if(self.black_can_castle_7): print('k',end='') no_castle_right=False if(self.black_can_castle_0): print('q',end='') no_castle_right=False if(no_castle_right): print('-',end='') print() # Displaying moves done from the history self.showHistory() #################################################################### def caseStr2Int(self,c): """'c' given in argument is a square name like 'e2' "This functino returns a square number like 52""" err=( 'The square name must be 2 caracters i.e. e2,e4,b1...', 'Incorrect square name. Please enter i.e. e2,e4,b1...' ) letters=('a','b','c','d','e','f','g','h') numbers=('1','2','3','4','5','6','7','8') if(len(c)!=2): print(err[0]) return -1 if(c[0] not in letters): print(err[1]) return -1 if(c[1] not in numbers): print(err[1]) return -1 return self.coord.index(c) #################################################################### def caseInt2Str(self,i): """Given in argument : an integer between 0 and 63 Returns a string like 'e2'""" err=( 'Square number must be in 0 to 63', ) letters=('a','b','c','d','e','f','g','h') numbers=('1','2','3','4','5','6','7','8') if(i<0 or i>63): print(err[0]) return return self.coord[i] #################################################################### @staticmethod def ROW(x): """ROW returns the number of the row from 0(a8-h8) to 7(a1-h1) in which is the square 'x'""" return (x >> 3) #################################################################### @staticmethod def COL(x): """COL returns the number of the colon (from 0 to 7) in which is the square 'x'""" return (x & 7) #################################################################### def showHistory(self): "Displays the history of the moves played" if(len(self.history)==0): return print() cpt,aff=1.0,True for (depart,\ arrivee,\ pieceDeplacee,\ piecePrise,\ isEp,\ histEp,\ promote,\ roque56,\ roque63,\ roque0,\ roque7) in self.history: a=self.caseInt2Str(depart) b=self.caseInt2Str(arrivee) if(piecePrise.isEmpty()==False): a=a+'x' if(promote!=''): b=b+promote if(aff==True): print("{}.{}{} ".format(int(cpt),a,b),end=' ') aff=False else: print("{}{} ".format(a,b),end=' ') aff=True cpt+=0.5 print() print() #################################################################### def evaluer(self): """A wonderful evaluate() function returning actually only the material score""" WhiteScore=0 BlackScore=0 # Parsing the board squares from 0 to 63 for pos1,piece in enumerate(self.cases): # Material score if(piece.couleur=='blanc'): WhiteScore+=piece.valeur else: # NB : here is for black piece or empty square BlackScore+=piece.valeur if(self.side2move=='blanc'): return WhiteScore-BlackScore else: return BlackScore-WhiteScore ####################################################################