From 4e8b7e8748a0c3985f4a7703c0511e7605736786 Mon Sep 17 00:00:00 2001 From: wuliaozhiji Date: Thu, 10 Feb 2022 18:43:51 -0500 Subject: [PATCH] [+] A2 Starter files --- assignments/A2/a2_game_tree.py | 171 ++ assignments/A2/a2_minichess.py | 483 +++++ assignments/A2/a2_part0.py | 43 + assignments/A2/a2_part1.py | 112 ++ assignments/A2/a2_part2.py | 119 ++ assignments/A2/a2_part3.py | 120 ++ assignments/A2/chessboard/.gitignore | 2 + assignments/A2/chessboard/LICENSE | 674 +++++++ assignments/A2/chessboard/README.md | 76 + assignments/A2/chessboard/__init__.py | 0 assignments/A2/chessboard/board.py | 208 ++ assignments/A2/chessboard/display.py | 99 + assignments/A2/chessboard/fenparser.py | 43 + assignments/A2/chessboard/images/bB.png | Bin 0 -> 905 bytes assignments/A2/chessboard/images/bK.png | Bin 0 -> 1955 bytes assignments/A2/chessboard/images/bN.png | Bin 0 -> 1239 bytes assignments/A2/chessboard/images/bP.png | Bin 0 -> 561 bytes assignments/A2/chessboard/images/bQ.png | Bin 0 -> 1797 bytes assignments/A2/chessboard/images/bR.png | Bin 0 -> 652 bytes assignments/A2/chessboard/images/btile.png | Bin 0 -> 330 bytes assignments/A2/chessboard/images/wB.png | Bin 0 -> 1475 bytes assignments/A2/chessboard/images/wK.png | Bin 0 -> 1910 bytes assignments/A2/chessboard/images/wN.png | Bin 0 -> 1508 bytes assignments/A2/chessboard/images/wP.png | Bin 0 -> 988 bytes assignments/A2/chessboard/images/wQ.png | Bin 0 -> 2288 bytes assignments/A2/chessboard/images/wR.png | Bin 0 -> 1043 bytes assignments/A2/chessboard/images/wtile.png | Bin 0 -> 208 bytes assignments/A2/chessboard/pieces.py | 95 + assignments/A2/data/small_sample.csv | 7 + assignments/A2/data/white_wins.csv | 2000 ++++++++++++++++++++ 30 files changed, 4252 insertions(+) create mode 100644 assignments/A2/a2_game_tree.py create mode 100644 assignments/A2/a2_minichess.py create mode 100644 assignments/A2/a2_part0.py create mode 100644 assignments/A2/a2_part1.py create mode 100644 assignments/A2/a2_part2.py create mode 100644 assignments/A2/a2_part3.py create mode 100644 assignments/A2/chessboard/.gitignore create mode 100644 assignments/A2/chessboard/LICENSE create mode 100644 assignments/A2/chessboard/README.md create mode 100644 assignments/A2/chessboard/__init__.py create mode 100644 assignments/A2/chessboard/board.py create mode 100644 assignments/A2/chessboard/display.py create mode 100644 assignments/A2/chessboard/fenparser.py create mode 100644 assignments/A2/chessboard/images/bB.png create mode 100644 assignments/A2/chessboard/images/bK.png create mode 100644 assignments/A2/chessboard/images/bN.png create mode 100644 assignments/A2/chessboard/images/bP.png create mode 100644 assignments/A2/chessboard/images/bQ.png create mode 100644 assignments/A2/chessboard/images/bR.png create mode 100644 assignments/A2/chessboard/images/btile.png create mode 100644 assignments/A2/chessboard/images/wB.png create mode 100644 assignments/A2/chessboard/images/wK.png create mode 100644 assignments/A2/chessboard/images/wN.png create mode 100644 assignments/A2/chessboard/images/wP.png create mode 100644 assignments/A2/chessboard/images/wQ.png create mode 100644 assignments/A2/chessboard/images/wR.png create mode 100644 assignments/A2/chessboard/images/wtile.png create mode 100644 assignments/A2/chessboard/pieces.py create mode 100644 assignments/A2/data/small_sample.csv create mode 100644 assignments/A2/data/white_wins.csv diff --git a/assignments/A2/a2_game_tree.py b/assignments/A2/a2_game_tree.py new file mode 100644 index 0000000..b0c0c4a --- /dev/null +++ b/assignments/A2/a2_game_tree.py @@ -0,0 +1,171 @@ +"""CSC111 Winter 2021 Assignment 2: Trees, Chess, and Artificial Intelligence (Game Tree) + +Instructions (READ THIS FIRST!) +=============================== + +This Python module contains the start of a GameTree class that you'll be working with +and modifying in this assignment. You WILL be submitting this file! + +Copyright and Usage Information +=============================== + +This file is provided solely for the personal and private use of students +taking CSC111 at the University of Toronto St. George campus. All forms of +distribution of this code, whether as given or with any changes, are +expressly prohibited. For more information on copyright for CSC111 materials, +please consult our Course Syllabus. + +This file is Copyright (c) 2022 Mario Badr, David Liu, and Isaac Waller. +""" +from __future__ import annotations +from typing import Optional + +GAME_START_MOVE = '*' + + +class GameTree: + """A decision tree for Minichess moves. + + Each node in the tree stores a Minichess move and a boolean representing whether + the current player (who will make the next move) is White or Black. + + Instance Attributes: + - move: the current chess move (expressed in chess notation), or '*' if this tree + represents the start of a game + - is_white_move: True if White is to make the next move after this, False otherwise + + Representation Invariants: + - self.move == GAME_START_MOVE or self.move is a valid Minichess move + - self.move != GAME_START_MOVE or self.is_white_move == True + """ + move: str + is_white_move: bool + + # Private Instance Attributes: + # - _subtrees: + # the subtrees of this tree, which represent the game trees after a possible + # move by the current player + _subtrees: list[GameTree] + + def __init__(self, move: str = GAME_START_MOVE, + is_white_move: bool = True) -> None: + """Initialize a new game tree. + + Note that this initializer uses optional arguments, as illustrated below. + + >>> game = GameTree() + >>> game.move == GAME_START_MOVE + True + >>> game.is_white_move + True + """ + self.move = move + self.is_white_move = is_white_move + self._subtrees = [] + + def get_subtrees(self) -> list[GameTree]: + """Return the subtrees of this game tree.""" + return self._subtrees + + def find_subtree_by_move(self, move: str) -> Optional[GameTree]: + """Return the subtree corresponding to the given move. + + Return None if no subtree corresponds to that move. + """ + for subtree in self._subtrees: + if subtree.move == move: + return subtree + + return None + + def add_subtree(self, subtree: GameTree) -> None: + """Add a subtree to this game tree.""" + self._subtrees.append(subtree) + + def __str__(self) -> str: + """Return a string representation of this tree. + """ + return self._str_indented(0) + + def _str_indented(self, depth: int) -> str: + """Return an indented string representation of this tree. + + The indentation level is specified by the parameter. + """ + if self.is_white_move: + turn_desc = "White's move" + else: + turn_desc = "Black's move" + move_desc = f'{self.move} -> {turn_desc}\n' + s = ' ' * depth + move_desc + if self._subtrees == []: + return s + else: + for subtree in self._subtrees: + s += subtree._str_indented(depth + 1) + return s + + ############################################################################ + # Part 1: Loading and "Replaying" Minichess games + ############################################################################ + def insert_move_sequence(self, moves: list[str]) -> None: + """Insert the given sequence of moves into this tree. + + The inserted moves form a chain of descendants, where: + - moves[0] is a child of this tree's root + - moves[1] is a child of moves[0] + - moves[2] is a child of moves[1] + - etc. + + Do not create duplicate moves that share the same parent; for example, if moves[0] is + already a child of this tree's root, you should recurse into that existing subtree rather + than create a new subtree with moves[0]. + But if moves[0] is not a child of this tree's root, create a new subtree for it + and append it to the existing list of subtrees. + + Implementation Notes: + - Your implementation must use recursion, and NOT use any loops to "go down" the tree. + - Your implementation must have a worst-case running time of Theta(m + n) time, + where m is the length of moves and n is the size of this tree. + This means you shouldn't use list slicing to access the "rest" of the list of moves, + like in Tutorial 4. Instead, you can use one of the following approaches: + + i) Use a recursive helper method that takes an extra "current index" argument to + keep track of the next move in the list. + ii) First reverse the list, and then use a recursive helper method that calls + `list.pop` on the list of moves. Just make sure the original list isn't changed + when the function ends! + """ + + ############################################################################ + # Part 2: Complete Game Trees and Win Probabilities + ############################################################################ + def _update_white_win_probability(self) -> None: + """Recalculate the white win probability of this tree. + + Note: like the "_length" Tree attribute from tutorial, you should only need + to update self here, not any of its subtrees. (You should *assume* that each + subtree has the correct white win probability already.) + + Use the following definition for the white win probability of self: + - if self is a leaf, don't change the white win probability + (leave the current value alone) + - if self is not a leaf and self.is_white_move is True, the white win probability + is equal to the MAXIMUM of the white win probabilities of its subtrees + - if self is not a leaf and self.is_white_move is False, the white win probability + is equal to the AVERAGE of the white win probabilities of its subtrees + """ + + +if __name__ == '__main__': + import python_ta.contracts + python_ta.contracts.check_all_contracts() + + import doctest + doctest.testmod() + + import python_ta + python_ta.check_all(config={ + 'max-line-length': 100, + 'disable': ['E1136'], + }) diff --git a/assignments/A2/a2_minichess.py b/assignments/A2/a2_minichess.py new file mode 100644 index 0000000..49b8ebf --- /dev/null +++ b/assignments/A2/a2_minichess.py @@ -0,0 +1,483 @@ +"""CSC111 Winter 2021 Assignment 2: Trees, Chess, and Artificial Intelligence (Minichess Library) + +Module Description +================== + +This module contains a collection of Python classes and functions that you'll use on +this assignment to represent games of Minichess. You are responsible for reading the +*docstrings* of this file to understand how to use these classes and functions, +but should not modify anything in this file. It will not be submitted, and we will +supply our own copy for grading purposes. + +Note: as is standard for CSC111, we use a leading underscore to indicate private +functions, methods, and instance attributes. You don't have to worry about any of these, +and in fact shouldn't use them in this assignment! + +Disclaimer: we didn't have time to make this file fully PythonTA-compliant! + +Copyright and Usage Information +=============================== + +This file is provided solely for the personal and private use of students +taking CSC111 at the University of Toronto St. George campus. All forms of +distribution of this code, whether as given or with any changes, are +expressly prohibited. For more information on copyright for CSC111 materials, +please consult our Course Syllabus. + +This file is Copyright (c) 2022 Mario Badr, David Liu, and Isaac Waller. +""" +from __future__ import annotations + +import copy +import random +import time +from typing import Optional + +import plotly.graph_objects as go +from plotly.subplots import make_subplots + +import chessboard.display as display + + +################################################################################ +# Representing Minichess +################################################################################ +_FILE_TO_INDEX = {'a': 0, 'b': 1, 'c': 2, 'd': 3} +_INDEX_TO_FILE = {i: f for f, i in _FILE_TO_INDEX.items()} +_RANK_TO_INDEX = {'1': 0, '2': 1, '3': 2, '4': 3} +_INDEX_TO_RANK = {i: r for r, i in _RANK_TO_INDEX.items()} + + +_MAX_MOVES = 50 + + +class MinichessGame: + """A class representing a state of a game of Minichess. + + >>> game = MinichessGame() + >>> # Get all valid moves for white at the start of the game. + >>> game.get_valid_moves() + ['a2b3', 'b2c3', 'b2a3', 'c2d3', 'c2b3', 'd2c3'] + >>> # Make a move. This method mutates the state of the game. + >>> game.make_move('a2b3') + >>> game.get_valid_moves() # Now, black only has one valid move + ['b4b3'] + >>> # If you try to make an invalid move, a ValueError is raised. + >>> game.make_move('a4d1') + Traceback (most recent call last): + ValueError: Move "a4d1" is not valid + >>> # This move is okay. + >>> game.make_move('b4b3') + >>> game.get_url() + 'https://lichess.org/analysis/standard/8/8/8/8/r1kr4/pqpp4/1PPP4/RQKR4' + """ + # Private Instance Attributes: + # - _board: a two-dimensional representation of a Minichess board + # - _valid_moves: a list of the valid moves of the current player + # - _is_white_active: a boolean representing whether white is the current player + # - _move_count: the number of moves that have been made in the current game + _board: list[list[Optional[_Piece]]] + _valid_moves: list[str] + _is_white_active: bool + _move_count: int + + def __init__(self, board: list[list[Optional[_Piece]]] = None, + white_active: bool = True, move_count: int = 0) -> None: + + if board is not None: + self._board = board + else: + self._board = [ + [_Piece('r', True), _Piece('q', True), _Piece('k', True), _Piece('r', True)], + [_Piece('p', True), _Piece('p', True), _Piece('p', True), _Piece('p', True)], + [_Piece('p', False), _Piece('p', False), _Piece('p', False), _Piece('p', False)], + [_Piece('r', False), _Piece('q', False), _Piece('k', False), _Piece('r', False)] + ] + + self._is_white_active = white_active + self._move_count = move_count + self._valid_moves = [] + + self._recalculate_valid_moves() + + def get_valid_moves(self) -> list[str]: + """Return a list of the valid moves for the active player.""" + return self._valid_moves + + def make_move(self, move: str) -> None: + """Make the given chess move. This instance of Minichess will be mutated, and will + afterwards represent the game state after move is made. + + If move is not a currently valid move, raise a ValueError. + """ + if move not in self._valid_moves: + raise ValueError(f'Move "{move}" is not valid') + + self._board = self._board_after_move(move) + + self._is_white_active = not self._is_white_active + self._move_count += 1 + + self._recalculate_valid_moves() + + def copy_and_make_move(self, move: str) -> MinichessGame: + """Make the given chess move in a copy of this MinichessGame, and return that copy. + + If move is not a currently valid move, raise a ValueError. + """ + if move not in self._valid_moves: + raise ValueError(f'Move "{move}" is not valid') + + return MinichessGame(board=self._board_after_move(move), + white_active=not self._is_white_active, + move_count=self._move_count + 1) + + def is_white_move(self) -> bool: + """Return whether the white player is to move next.""" + return self._is_white_active + + def get_winner(self) -> Optional[str]: + """Return the winner of the game (black or white) or 'draw' if the game ended in a draw. + + Return None if the game is not over. + """ + if self._move_count >= _MAX_MOVES: + return 'Draw' + elif len(self._valid_moves) == 0: + return 'Black' if self._is_white_active else 'White' + else: + return None + + def _calculate_moves_for_board(self, board: list[list[Optional[_Piece]]], + is_white_active: bool) -> tuple: + """Return all possible moves on a given board with a given active player.""" + moves = [] + # Used to calculate whether the other players' king is in check + # (i.e. the black king if is_white_active, otherwise the white king) + check = [] + + for pos in [(y, x) for y in range(0, 4) for x in range(0, 4)]: + piece = board[pos[0]][pos[1]] + if piece is None or piece.is_white != is_white_active: + continue + + kind, is_white = piece.kind, piece.is_white + + if kind == 'p': + # Pawns can only move towards the opponent's end of the board. + direction = 1 if is_white else -1 + + check += self._find_moves_in_direction(board, moves, pos, is_white, (direction, 0), + limit=1, capture=False) + check += self._find_moves_in_direction(board, moves, pos, is_white, (direction, 1), + limit=1, capture=True) + check += self._find_moves_in_direction(board, moves, pos, is_white, (direction, -1), + limit=1, capture=True) + + if kind == 'r' or kind == 'q': + check += self._find_moves_in_direction(board, moves, pos, is_white, (0, 1)) + check += self._find_moves_in_direction(board, moves, pos, is_white, (1, 0)) + check += self._find_moves_in_direction(board, moves, pos, is_white, (0, -1)) + check += self._find_moves_in_direction(board, moves, pos, is_white, (-1, 0)) + + if kind == 'q': + for y, x in [(y, x) for y in [-1, 1] for x in [-1, 1]]: + check += self._find_moves_in_direction(board, moves, pos, is_white, (y, x)) + + if kind == 'k': + for y, x in [(y, x) for y in [-1, 0, 1] for x in [-1, 0, 1]]: + check += self._find_moves_in_direction(board, moves, pos, is_white, (y, x), + limit=1) + + return moves, check + + def _find_moves_in_direction(self, board, moves, pos, is_white, direction, limit=None, + capture=None): + """Find valid moves moving in a given direction from a certain position. + + capture: True if must capture, False if must not capture, None otherwise. + """ + + move_start = _index_to_algebraic(pos) + stop = False + i = 1 + check = [] + while not stop: + y, x = pos[0] + direction[0] * i, pos[1] + direction[1] * i + + if x < 0 or y < 0 or x > 3 or y > 3: + break # Out of bounds + + contents = board[y][x] + move = move_start + _index_to_algebraic((y, x)) + + if contents is not None: + # Square contains piece + stop = True + + if contents.is_white != is_white and contents.kind == 'k' \ + and capture is not False: + # Cannot capture king, but they are in check + check.append(move) + elif contents.is_white != is_white and capture is not False: + # Capture + moves.append(move) + else: + # Empty square + if capture is not True: + moves.append(move) + + i += 1 + + if limit is not None and i > limit: + stop = True + + return check + + def _board_after_move(self, move: str) -> list[list[Optional[_Piece]]]: + """Return a copy of self._board representing the state of the board after making move. + """ + board_copy = copy.deepcopy(self._board) + + start_pos = _algebraic_to_index(move[0:2]) + end_pos = _algebraic_to_index(move[2:]) + + board_copy[end_pos[0]][end_pos[1]] = board_copy[start_pos[0]][start_pos[1]] + board_copy[start_pos[0]][start_pos[1]] = None + + return board_copy + + def _recalculate_valid_moves(self) -> None: + """Update the valid moves for this game board.""" + + moves, check = self._calculate_moves_for_board(self._board, self._is_white_active) + + assert len(check) == 0, \ + "The other player's king can never be in check at the start of your turn." + + # Filter moves that would leave the current player's king in check + valid_moves = [] + for move in moves: + board_copy = self._board_after_move(move) + _, check = self._calculate_moves_for_board(board_copy, not self._is_white_active) + if len(check) == 0: + valid_moves.append(move) + + self._valid_moves = valid_moves + + def get_fen(self) -> str: + """Return a string description of the current game state in Forsyth-Edwards Notation. + + Reference: https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation. + + This method is used to visualize the game board using Pygame---you won't need to call it + directly. + """ + rows = [''.join([(p.fen() if p is not None else '1') for p in row]) + '4' for row in + self._board] + return '/'.join(reversed(rows)) + + def get_url(self) -> str: + """Return a URL to a web page where you can examine the current state of the board.""" + return "https://lichess.org/analysis/standard/8/8/8/8/" + self.get_fen() + + +def _algebraic_to_index(move: str) -> tuple[int, int]: + """Convert coordinates in algebraic format ex. 'a2' to array indices (y, x).""" + return (_RANK_TO_INDEX[move[1]], _FILE_TO_INDEX[move[0]]) + + +def _index_to_algebraic(pos: tuple[int, int]) -> str: + """Convert coordinates in array indices (y, x) to algebraic format.""" + return _INDEX_TO_FILE[pos[1]] + _INDEX_TO_RANK[pos[0]] + + +class _Piece: + """Represents a single piece in Minichess. + + Instance Attributes: + - kind: the type of piece + - is_white: whether the piece belongs to the white player + """ + kind: str # One of 'rqkp' (rook, queen, king, pawn) + is_white: bool + + def __init__(self, kind: str, is_white: bool) -> None: + """Initialize a new piece.""" + self.kind = kind + self.is_white = is_white + + def fen(self) -> str: + """Return the string representing this piece in FEN.""" + if self.is_white: + return self.kind.upper() + else: + return self.kind + + def __str__(self) -> str: + return self.fen() + + +################################################################################ +# Chess player classes +################################################################################ +class Player: + """An abstract class representing a Minichess AI. + + This class can be subclassed to implement different strategies for playing chess. + """ + + def make_move(self, game: MinichessGame, previous_move: Optional[str]) -> str: + """Make a move given the current game. + + previous_move is the opponent player's most recent move, or None if no moves + have been made. + + Preconditions: + - There is at least one valid move for the given game + """ + raise NotImplementedError + + +class RandomPlayer(Player): + """A Minichess AI whose strategy is always picking a random move.""" + + def make_move(self, game: MinichessGame, previous_move: Optional[str]) -> str: + """Make a move given the current game. + + previous_move is the opponent player's most recent move, or None if no moves + have been made. + + Preconditions: + - There is at least one valid move for the given game + """ + possible_moves = game.get_valid_moves() + return random.choice(possible_moves) + + +################################################################################ +# Functions for running games +################################################################################ +DEFAULT_FPS = 6 # Default number of moves per second to display in the visualization + + +def run_games(n: int, white: Player, black: Player, + visualize: bool = False, fps: int = DEFAULT_FPS, + show_stats: bool = False) -> None: + """Run n games using the given Players. + + Optional arguments: + - visualize: whether to use Pygame to visualize the games + - fps: the number of moves per second to display (only relevant if visualize is True) + - show_stats: whether to use Plotly to display statistics for the game runs + + Preconditions: + - n >= 1 + - fps >= 1 + """ + if visualize: + _initialize_display() + + stats = {'White': 0, 'Black': 0, 'Draw': 0} + results = [] + for i in range(0, n): + white_copy = copy.deepcopy(white) + black_copy = copy.deepcopy(black) + + winner, _ = run_game(white_copy, black_copy, visualize, fps) + stats[winner] += 1 + results.append(winner) + + print(f'Game {i} winner: {winner}') + + for outcome in stats: + print(f'{outcome}: {stats[outcome]}/{n} ({100.0 * stats[outcome] / n:.2f}%)') + + if visualize: + _terminate_display() + + if show_stats: + plot_game_statistics(results) + + +def run_game(white: Player, black: Player, + visualize: bool = False, fps: int = DEFAULT_FPS) -> tuple[str, list[str]]: + """Run a Minichess game between the two given players. + + Return the winner and list of moves made in the game. + """ + game = MinichessGame() + + move_sequence = [] + previous_move = None + current_player = white + while game.get_winner() is None: + + previous_move = current_player.make_move(game, previous_move) + game.make_move(previous_move) + move_sequence.append(previous_move) + + if visualize: + display.update(game.get_fen(), game.get_winner()) + time.sleep(1 / fps) + + if current_player is white: + current_player = black + else: + current_player = white + + if visualize: + # Give slightly more time to the victory visualization + time.sleep(4 / fps) + + return game.get_winner(), move_sequence + + +def _initialize_display() -> None: + """Initialize the Minichess visualization pygame window.""" + display.start('8/8/8/8', size=4) + + +def _terminate_display() -> None: + """Close the Minichess visualization pygame window.""" + display.terminate() + + +def plot_game_statistics(results: list[str]) -> None: + """Plot the outcomes and win probabilities for a given list of Minichess game results. + + Preconditions: + - all(r in {'White', 'Black', 'Draw'} for r in results) + """ + outcomes = [1 if result == 'White' else 0 for result in results] + + cumulative_win_probability = [sum(outcomes[0:i]) / i for i in range(1, len(outcomes) + 1)] + rolling_win_probability = \ + [sum(outcomes[max(i - 50, 0):i]) / min(50, i) for i in range(1, len(outcomes) + 1)] + + fig = make_subplots(rows=2, cols=1) + fig.add_trace(go.Scatter(y=outcomes, mode='markers', + name='Outcome (1 = White win, 0 = Draw/Black win)'), + row=1, col=1) + fig.add_trace(go.Scatter(y=cumulative_win_probability, mode='lines', + name='White win percentage (cumulative)'), + row=2, col=1) + fig.add_trace(go.Scatter(y=rolling_win_probability, mode='lines', + name='White win percentage (most recent 50 games)'), + row=2, col=1) + fig.update_yaxes(range=[0.0, 1.0], row=2, col=1) + + fig.update_layout(title='Minichess Game Results', xaxis_title='Game') + fig.show() + # fig.write_image('stats.png') + + +if __name__ == '__main__': + import doctest + doctest.testmod() + + # Demo running Minichess games being played between two random players + # run_games(100, RandomPlayer(), RandomPlayer(), show_stats=True) + + # Try running this to visualize games (takes longer) + # run_games(20, RandomPlayer(), RandomPlayer(), visualize=True, fps=10, show_stats=True) diff --git a/assignments/A2/a2_part0.py b/assignments/A2/a2_part0.py new file mode 100644 index 0000000..ae659d9 --- /dev/null +++ b/assignments/A2/a2_part0.py @@ -0,0 +1,43 @@ +"""CSC111 Winter 2021 Assignment 2: Trees, Chess, and Artificial Intelligence (Part 0) + +Module Description +=============================== + +This Python module contains a sample GameTree that matches an example from the assignment +handout. Please feel free to modify this file to experiment with the code found in +a2_game_tree.py and a2_minichess.py. You won't be submitting this file for grading (nor +will this file affect other parts of this assignment). + +Copyright and Usage Information +=============================== + +This file is provided solely for the personal and private use of students +taking CSC111 at the University of Toronto St. George campus. All forms of +distribution of this code, whether as given or with any changes, are +expressly prohibited. For more information on copyright for CSC111 materials, +please consult our Course Syllabus. + +This file is Copyright (c) 2022 Mario Badr, David Liu, and Isaac Waller. +""" +from a2_game_tree import GameTree, GAME_START_MOVE + + +def build_sample_game_tree() -> GameTree: + """Create an example game tree.""" + game_tree = GameTree(GAME_START_MOVE, True) + + game_tree.add_subtree(GameTree('a2b3', False)) + game_tree.add_subtree(GameTree('b2c3', False)) + game_tree.add_subtree(GameTree('b2a3', False)) + + sub1 = GameTree('c2d3', False) + sub2 = GameTree('d4d3', True) + sub2.add_subtree(GameTree('d2c3', False)) + sub2.add_subtree(GameTree('b1d3', False)) + sub1.add_subtree(sub2) + game_tree.add_subtree(sub1) + + game_tree.add_subtree(GameTree('c2b3', False)) + game_tree.add_subtree(GameTree('d2c3', False)) + + return game_tree diff --git a/assignments/A2/a2_part1.py b/assignments/A2/a2_part1.py new file mode 100644 index 0000000..b037379 --- /dev/null +++ b/assignments/A2/a2_part1.py @@ -0,0 +1,112 @@ +"""CSC111 Winter 2021 Assignment 2: Trees, Chess, and Artificial Intelligence (Part 1) + +Instructions (READ THIS FIRST!) +=============================== + +This Python module contains the start of functions and/or classes you'll define +for Part 1 of this assignment. Please note that in addition to this file, you will +also need to modify a2_game_tree.py by following the instructions on the assignment +handout. You should NOT make any changes to a2_minichess.py. + +Copyright and Usage Information +=============================== + +This file is provided solely for the personal and private use of students +taking CSC111 at the University of Toronto St. George campus. All forms of +distribution of this code, whether as given or with any changes, are +expressly prohibited. For more information on copyright for CSC111 materials, +please consult our Course Syllabus. + +This file is Copyright (c) 2022 Mario Badr, David Liu, and Isaac Waller. +""" +import csv +import random +from typing import Optional + +import a2_game_tree +import a2_minichess + + +################################################################################ +# Loading Minichess datasets +################################################################################ +def load_game_tree(games_file: str) -> a2_game_tree.GameTree: + """Create a game tree based on games_file. + + Preconditions: + - games_file refers to a csv file in the format described on the assignment handout + + Implementation hints: + - You can review Tutorial 4 for how we read CSV files in Python. + """ + + +################################################################################ +# Minichess AI that uses a GameTree +################################################################################ +class RandomTreePlayer(a2_minichess.Player): + """A Minichess player that plays randomly based on a given GameTree. + + This player uses a game tree to make moves, descending into the tree as the game is played. + On its turn: + + 1. First it updates its game tree to its subtree corresponding to the move made by + its opponent. If no subtree is found, its game tree is set to None. + 2. Then, if its game tree is not None, it picks its next move randomly from among + the subtrees of its game tree, and then reassigns its game tree to that subtree. + But if its game tree is None or has no subtrees, the player picks its next move randomly, + and then sets its game tree to None. + """ + # Private Instance Attributes: + # - _game_tree: + # The GameTree that this player uses to make its moves. If None, then this + # player just makes random moves. + _game_tree: Optional[a2_game_tree.GameTree] + + def __init__(self, game_tree: a2_game_tree.GameTree) -> None: + """Initialize this player. + + Preconditions: + - game_tree represents a game tree at the initial state (root is '*') + """ + self._game_tree = game_tree + + def make_move(self, game: a2_minichess.MinichessGame, previous_move: Optional[str]) -> str: + """Make a move given the current game. + + previous_move is the opponent player's most recent move, or None if no moves + have been made. + + Preconditions: + - There is at least one valid move for the given game + """ + + +def part1_runner(games_file: str, n: int, black_random: bool) -> None: + """Create a game tree from the given file, and run n games where White is a RandomTreePlayer. + + The White player is a RandomTreePlayer whose game tree is the one generated from games_file. + The Black player is a RandomPlayer if black_random is True, otherwise it is a RandomTreePlayer + using the SAME game tree as White. + + Preconditions: + - n >= 1 + - games_file refers to a csv file in the format described on the assignment handout + + Implementation notes: + - Your implementation MUST correctly call a2_minichess.run_games. You may choose + the values for the optional arguments passed to the function. + """ + + +if __name__ == '__main__': + import python_ta + python_ta.check_all(config={ + 'max-line-length': 100, + 'disable': ['E1136'], + 'extra-imports': ['a2_minichess', 'a2_game_tree', 'random', 'csv'], + 'allowed-io': ['load_game_tree'] + }) + + # Sample call to part1_runner (you can change this, just keep it in the main block!) + # part1_runner('data/white_wins.csv', 50, True) diff --git a/assignments/A2/a2_part2.py b/assignments/A2/a2_part2.py new file mode 100644 index 0000000..a7a4ba5 --- /dev/null +++ b/assignments/A2/a2_part2.py @@ -0,0 +1,119 @@ +"""CSC111 Winter 2021 Assignment 2: Trees, Chess, and Artificial Intelligence (Part 2) + +Instructions (READ THIS FIRST!) +=============================== + +This Python module contains the start of functions and/or classes you'll define +for Part 2 of this assignment. Please note that in addition to this file, you will +also need to modify a2_game_tree.py by following the instructions on the assignment +handout. You should NOT make any changes to a2_minichess.py. + +Copyright and Usage Information +=============================== + +This file is provided solely for the personal and private use of students +taking CSC111 at the University of Toronto St. George campus. All forms of +distribution of this code, whether as given or with any changes, are +expressly prohibited. For more information on copyright for CSC111 materials, +please consult our Course Syllabus. + +This file is Copyright (c) 2022 Mario Badr, David Liu, and Isaac Waller. +""" +import random +from typing import Optional + +import a2_game_tree +import a2_minichess + + +def generate_complete_game_tree(root_move: str, game_state: a2_minichess.MinichessGame, + d: int) -> a2_game_tree.GameTree: + """Generate a complete game tree of depth d for all valid moves from the current game_state. + + For the returned GameTree: + - Its root move is root_move. + - Its `is_white_move` attribute is set using the current game_state. + - It contains all possible move sequences of length <= d from game_state. + For each node in the tree, its subtrees appear in the same order that their + moves were returned by game_state.get_valid_moves(), + - If d == 0, a size-one GameTree is returned. + + Note that some paths down the tree may have length < d, because they result in an end state + (win or draw) from game_state in fewer than d moves. + + Preconditions: + - d >= 0 + - root_move == GAME_START_MOVE or root_move is a valid chess move + - if root_move == GAME_START_MOVE, then game_state is in the initial game state + + Implementation hints: + - This function must be implemented recursively. + - In the recursive step, use the MinichessGame.copy_and_make_move method to create + a copy of the game state with one new move made. + - You'll need to review the public interface of the MinichessGame class to see what + methods are available to help implement this function. + + WARNING: we recommend not calling this function with depth greater than 6, as this will + likely take a very long time on your computer. + """ + + +class GreedyTreePlayer(a2_minichess.Player): + """A Minichess player that plays greedily based on a given GameTree. + + See assignment handout for description of its strategy. + """ + # Private Instance Attributes: + # - _game_tree: + # The GameTree that this player uses to make its moves. If None, then this + # player just makes random moves. + _game_tree: Optional[a2_game_tree.GameTree] + + def __init__(self, game_tree: a2_game_tree.GameTree) -> None: + """Initialize this player. + + Preconditions: + - game_tree represents a game tree at the initial state (root is '*') + """ + self._game_tree = game_tree + + def make_move(self, game: a2_minichess.MinichessGame, previous_move: Optional[str]) -> str: + """Make a move given the current game. + + previous_move is the opponent player's most recent move, or None if no moves + have been made. + + Preconditions: + - There is at least one valid move for the given game + """ + + +def part2_runner(d: int, n: int, white_greedy: bool) -> None: + """Create a complete game tree with the given depth, and run n games where + one player is a GreedyTreePlayer and the other is a RandomPlayer. + + The GreedyTreePlayer uses the complete game tree with the given depth. + If white_greedy is True, the White player is the GreedyTreePlayer and Black is a RandomPlayer. + This is switched when white_greedy is False. + + Precondtions: + - d >= 0 + - n >= 1 + + Implementation notes: + - Your implementation MUST correctly call a2_minichess.run_games. You may choose + the values for the optional arguments passed to the function. + """ + + +if __name__ == '__main__': + import python_ta + python_ta.check_all(config={ + 'max-line-length': 100, + 'max-nested-blocks': 4, + 'disable': ['E1136'], + 'extra-imports': ['random', 'a2_minichess', 'a2_game_tree'] + }) + + # Sample call to part2_runner (you can change this, just keep it in the main block!) + # part2_runner(5, 50, False) diff --git a/assignments/A2/a2_part3.py b/assignments/A2/a2_part3.py new file mode 100644 index 0000000..bcc5933 --- /dev/null +++ b/assignments/A2/a2_part3.py @@ -0,0 +1,120 @@ +"""CSC111 Winter 2021 Assignment 2: Trees, Chess, and Artificial Intelligence (Part 3) + +Instructions (READ THIS FIRST!) +=============================== + +This Python module contains the start of functions and/or classes you'll define +for Part 3 of this assignment. You should NOT make any changes to a2_minichess.py. + +Copyright and Usage Information +=============================== + +This file is provided solely for the personal and private use of students +taking CSC111 at the University of Toronto St. George campus. All forms of +distribution of this code, whether as given or with any changes, are +expressly prohibited. For more information on copyright for CSC111 materials, +please consult our Course Syllabus. + +This file is Copyright (c) 2022 Mario Badr, David Liu, and Isaac Waller. +""" +import random +from typing import Optional + +import a2_game_tree +import a2_minichess + + +class ExploringPlayer(a2_minichess.Player): + """A Minichess player that plays greedily some of the time, and randomly some of the time. + + See assignment handout for details. + """ + # Private Instance Attributes: + # - _game_tree: + # The GameTree that this player uses to make its moves. If None, then this + # player just makes random moves. + _game_tree: Optional[a2_game_tree.GameTree] + _exploration_probability: float + + def __init__(self, game_tree: a2_game_tree.GameTree, exploration_probability: float) -> None: + """Initialize this player.""" + self._game_tree = game_tree + self._exploration_probability = exploration_probability + + def make_move(self, game: a2_minichess.MinichessGame, previous_move: Optional[str]) -> str: + """Make a move given the current game. + + previous_move is the opponent player's most recent move, or None if no moves + have been made. + + Preconditions: + - There is at least one valid move for the given game + """ + + +def run_learning_algorithm(exploration_probabilities: list[float], + show_stats: bool = True) -> a2_game_tree.GameTree: + """Play a sequence of Minichess games using an ExploringPlayer as the White player. + + This algorithm first initializes an empty GameTree. All ExploringPlayers will use this + SAME GameTree object, which will be mutated over the course of the algorithm! + Return this object. + + There are len(exploration_probabilities) games played, where at game i (starting at 0): + - White is an ExploringPlayer (using the game tree) whose exploration probability + is equal to exploration_probabilities[i] + - Black is a RandomPlayer + - AFTER the game, the move sequence from the game is inserted into the game tree, + with a white win probability of 1.0 if White won the game, and 0.0 otherwise. + + Implementation note: + - A NEW ExploringPlayer instance should be created for each loop iteration. + However, each one should use the SAME GameTree object. + - You should call run_game, NOT run_games, from a2_minichess. This is because you + need more control over what happens after each game runs, which you can get by + writing your own loop that calls run_game. However, you can base your loop on + the implementation of run_games. + - Note that run_game from a2_minichess returns both the winner and the move sequence + after the game ends. + - You may call print in this function to report progress made in each game. + - Note that this function returns the final GameTree object. You can inspect the + white_win_probability of its nodes, calculate its size, or and use it in a + RandomTreePlayer or GreedyTreePlayer to see how they do with it. + """ + # Start with a GameTree in the initial state + game_tree = a2_game_tree.GameTree() + + # Play games using the ExploringPlayer and update the GameTree after each one + results_so_far = [] + + # Write your loop here, according to the description above. + + if show_stats: + a2_minichess.plot_game_statistics(results_so_far) + + return game_tree + + +def part3_runner() -> a2_game_tree.GameTree: + """Run example for Part 3. + + Please note that unlike part1_runner and part2_runner, this function is NOT graded. + We encourage you to experiment with different exploration probability sequences + to see how quickly you can develop a "winning" GameTree! + """ + probabilities = [0.0] * 700 + + return run_learning_algorithm(probabilities) + + +if __name__ == '__main__': + import python_ta + python_ta.check_all(config={ + 'max-line-length': 100, + 'max-nested-blocks': 4, + 'disable': ['E1136'], + 'extra-imports': ['random', 'a2_minichess', 'a2_game_tree'], + 'allowed-io': ['run_learning_algorithm'] + }) + + part3_runner() diff --git a/assignments/A2/chessboard/.gitignore b/assignments/A2/chessboard/.gitignore new file mode 100644 index 0000000..09bf5d6 --- /dev/null +++ b/assignments/A2/chessboard/.gitignore @@ -0,0 +1,2 @@ +*.pyc +__pycache__/ \ No newline at end of file diff --git a/assignments/A2/chessboard/LICENSE b/assignments/A2/chessboard/LICENSE new file mode 100644 index 0000000..61d1860 --- /dev/null +++ b/assignments/A2/chessboard/LICENSE @@ -0,0 +1,674 @@ +GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. \ No newline at end of file diff --git a/assignments/A2/chessboard/README.md b/assignments/A2/chessboard/README.md new file mode 100644 index 0000000..a005e8b --- /dev/null +++ b/assignments/A2/chessboard/README.md @@ -0,0 +1,76 @@ +# chess-board + +## What is chess-board? + +chess-board is a Python chessboard package with a flexible "just a board" API for graphically representing game positions. + +## What chess-board is **not** + +- A chess engine +- A legal move validator +- A PGN parser + +While chess-board is designed to work well with any of these, the idea behind chess-board is that the logic that controls the board should be independent of those other problems. + +## Usage +**test.py** - _example_ +```sh +from chessboard import display + +position = 'rnbqkbnr/pp1ppppp/8/2p5/4P3/5N2/PPPP1PPP/RNBQKB1R b KQkq - 1 2' + +while True: + display.start(position) +``` + +## Entry Points +```sh +from chessboard import display + +validfen = 'rnbqkbnr/pp1ppppp/8/2p5/4P3/5N2/PPPP1PPP/RNBQKB1R b KQkq - 1 2' + +# Initialization +display.start() + +# Position change/update +display.update(validfen) + +# Checking GUI window for QUIT event. (Esc or GUI CANCEL) +display.checkForQuit() + +# Close window +display.terminate() + +``` +## Installation +Download and install the latest release: +```sh +# install into virtualenv +pip install chess-board + +or + +# install with pipenv +pipenv install chess-board + +or + +# install system-wide (windows), run cmd[powershell] as administrator +pip install chess-board +``` + +Alternatively, you could **git clone** this repo and add the directory to your package. + +```sh +git clone https://github.com/ahira-justice/chess-board.git +``` + +## Dependencies +```sh +pygame +``` +**chess-board** installation automatically installs latest **pygame** version. + +## License + +[GNU GENERAL PUBLIC LICENSE](LICENSE) diff --git a/assignments/A2/chessboard/__init__.py b/assignments/A2/chessboard/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/assignments/A2/chessboard/board.py b/assignments/A2/chessboard/board.py new file mode 100644 index 0000000..3ade1b1 --- /dev/null +++ b/assignments/A2/chessboard/board.py @@ -0,0 +1,208 @@ +""" + Ahira Justice, ADEFOKUN + justiceahira@gmail.com +""" + + +import os +import pygame + +from . import pieces +from . import fenparser + + +BASE_DIR = os.path.dirname(os.path.abspath(__file__)) +IMAGE_DIR = os.path.join(BASE_DIR, 'images') + + +class Board: + + btile = pygame.image.load(os.path.join(IMAGE_DIR, 'btile.png')) + wtile = pygame.image.load(os.path.join(IMAGE_DIR, 'wtile.png')) + + def __init__(self, colors, BGCOLOR, DISPLAYSURF, size=8): + self.colors = colors + self.BGCOLOR = BGCOLOR + self.DISPLAYSURF = DISPLAYSURF + self.font = pygame.font.Font(pygame.font.get_default_font(), 24) + + self.pieceRect = [] + + self.boardRect, self.tile_size = self._generate_board_rect(size) + + def _generate_board_rect(self, size): + + start = 100 + end = 500 + stride = (end - start) // size + board_rect = [] + + for column in range(0, size): + board_rect.append(tuple([(start + row * stride, start + column * stride) for row in range(0, size)])) + + return board_rect, stride + + def displayBoard(self): + self.DISPLAYSURF.fill(self.BGCOLOR) + pygame.draw.rect(self.DISPLAYSURF, self.colors['Black'], (95, 95, 410, 410), 10) + + self.drawTiles() + + + def drawTiles(self): + wtile = pygame.transform.scale(Board.wtile, (self.tile_size, self.tile_size)) + btile = pygame.transform.scale(Board.btile, (self.tile_size, self.tile_size)) + + for i in range(1, len(self.boardRect)+1): + for j in range(1, len(self.boardRect[i-1])+1): + if self.isOdd(i): + if self.isOdd(j): + self.DISPLAYSURF.blit(wtile, self.boardRect[i-1][j-1]) + elif self.isEven(j): + self.DISPLAYSURF.blit(btile, self.boardRect[i-1][j-1]) + elif self.isEven(i): + if self.isOdd(j): + self.DISPLAYSURF.blit(btile, self.boardRect[i-1][j-1]) + elif self.isEven(j): + self.DISPLAYSURF.blit(wtile, self.boardRect[i-1][j-1]) + + # draw letters + files = 'abcdefgh' + ranks = '12345678' + size = len(self.boardRect) + for i in range(0, len(self.boardRect)): + + text_surface = self.font.render(ranks[size - i - 1], True, (200, 200, 200)) + rect = self.boardRect[i][-1] + rect = (rect[0] + self.tile_size + 20, rect[1] + 40) + self.DISPLAYSURF.blit(text_surface, dest=rect) + + for i in range(0, len(self.boardRect)): + text_surface = self.font.render(files[i], True, (200, 200, 200)) + rect = self.boardRect[-1][i] + rect = (rect[0] + 40, rect[1] + self.tile_size + 15) + self.DISPLAYSURF.blit(text_surface, dest=rect) + + + def isOdd(self, number): + if number % 2 == 1: + return True + + + def isEven(self, number): + if number % 2 == 0: + return True + + + def drawPieces(self): + self.mapPieces() + + for piece in self.pieceRect: + piece.displayPiece() + + + def mapPieces(self): + for i in range(len(Board.posb)): + if i in [0, 1, 2, 3, 4, 5, 6, 7]: + piece = self.createPiece(pieces.BLACK, pieces.PAWN, Board.posb[i]) + self.pieceRect.append(piece) + elif i in [8, 15]: + piece = self.createPiece(pieces.BLACK, pieces.ROOK, Board.posb[i]) + self.pieceRect.append(piece) + elif i in [9, 14]: + piece = self.createPiece(pieces.BLACK, pieces.KNGHT, Board.posb[i]) + self.pieceRect.append(piece) + elif i in [10, 13]: + piece = self.createPiece(pieces.BLACK, pieces.BISHOP, Board.posb[i]) + self.pieceRect.append(piece) + elif i in [11]: + piece = self.createPiece(pieces.BLACK, pieces.QUEEN, Board.posb[i]) + self.pieceRect.append(piece) + elif i in [12]: + piece = self.createPiece(pieces.BLACK, pieces.KING, Board.posb[i]) + self.pieceRect.append(piece) + + for i in range(len(Board.posw)): + if i in [0, 1, 2, 3, 4, 5, 6, 7]: + piece = self.createPiece(pieces.WHITE, pieces.PAWN, Board.posw[i]) + self.pieceRect.append(piece) + elif i in [8, 15]: + piece = self.createPiece(pieces.WHITE, pieces.ROOK, Board.posw[i]) + self.pieceRect.append(piece) + elif i in [9, 14]: + piece = self.createPiece(pieces.WHITE, pieces.KNGHT, Board.posw[i]) + self.pieceRect.append(piece) + elif i in [10, 13]: + piece = self.createPiece(pieces.WHITE, pieces.BISHOP, Board.posw[i]) + self.pieceRect.append(piece) + elif i in [11]: + piece = self.createPiece(pieces.WHITE, pieces.QUEEN, Board.posw[i]) + self.pieceRect.append(piece) + elif i in [12]: + piece = self.createPiece(pieces.WHITE, pieces.KING, Board.posw[i]) + self.pieceRect.append(piece) + + + def createPiece(self, color, type, position): + piece = pieces.Piece(color, type, self.DISPLAYSURF, self.tile_size) + piece.setPosition(position) + return piece + + + def updatePieces(self, fen): + self.pieceRect = [] + fp = fenparser.FenParser(fen) + fenboard = fp.parse() + + for i in range(len(fenboard)): + for j in range(len(fenboard[i])): + if fenboard[i][j] in ['b', 'B']: + if fenboard[i][j] == 'b': + piece = self.createPiece(pieces.BLACK, pieces.BISHOP, self.boardRect[i][j]) + self.pieceRect.append(piece) + elif fenboard[i][j] == 'B': + piece = self.createPiece(pieces.WHITE, pieces.BISHOP, self.boardRect[i][j]) + self.pieceRect.append(piece) + + elif fenboard[i][j] in ['k', 'K']: + if fenboard[i][j] == 'k': + piece = self.createPiece(pieces.BLACK, pieces.KING, self.boardRect[i][j]) + self.pieceRect.append(piece) + elif fenboard[i][j] == 'K': + piece = self.createPiece(pieces.WHITE, pieces.KING, self.boardRect[i][j]) + self.pieceRect.append(piece) + + elif fenboard[i][j] in ['n', 'N']: + if fenboard[i][j] == 'n': + piece = self.createPiece(pieces.BLACK, pieces.KNGHT, self.boardRect[i][j]) + self.pieceRect.append(piece) + elif fenboard[i][j] == 'N': + piece = self.createPiece(pieces.WHITE, pieces.KNGHT, self.boardRect[i][j]) + self.pieceRect.append(piece) + + elif fenboard[i][j] in ['p', 'P']: + if fenboard[i][j] == 'p': + piece = self.createPiece(pieces.BLACK, pieces.PAWN, self.boardRect[i][j]) + self.pieceRect.append(piece) + elif fenboard[i][j] == 'P': + piece = self.createPiece(pieces.WHITE, pieces.PAWN, self.boardRect[i][j]) + self.pieceRect.append(piece) + + elif fenboard[i][j] in ['q', 'Q']: + if fenboard[i][j] == 'q': + piece = self.createPiece(pieces.BLACK, pieces.QUEEN, self.boardRect[i][j]) + self.pieceRect.append(piece) + elif fenboard[i][j] == 'Q': + piece = self.createPiece(pieces.WHITE, pieces.QUEEN, self.boardRect[i][j]) + self.pieceRect.append(piece) + + elif fenboard[i][j] in ['r', 'R']: + if fenboard[i][j] == 'r': + piece = self.createPiece(pieces.BLACK, pieces.ROOK, self.boardRect[i][j]) + self.pieceRect.append(piece) + elif fenboard[i][j] == 'R': + piece = self.createPiece(pieces.WHITE, pieces.ROOK, self.boardRect[i][j]) + self.pieceRect.append(piece) + + for piece in self.pieceRect: + piece.displayPiece() diff --git a/assignments/A2/chessboard/display.py b/assignments/A2/chessboard/display.py new file mode 100644 index 0000000..ce2b09a --- /dev/null +++ b/assignments/A2/chessboard/display.py @@ -0,0 +1,99 @@ +""" + Ahira Justice, ADEFOKUN + justiceahira@gmail.com +""" + + +import os +import sys +import pygame +from pygame.locals import * + +from . import board + + +os.environ['SDL_VIDEO_CENTERED'] = '1' # Centre display window. + +FPS = 30 +FPSCLOCK = pygame.time.Clock() + +DISPLAYSURF = None + +BASICFONT = None + +gameboard = None + +colors = { + 'Ash': ( 50, 50, 50), + 'White':(255, 255, 255), + 'Black':( 0, 0, 0), +} + +BGCOLOR = colors['Ash'] + +WINDOWWIDTH, WINDOWHEIGHT = 600, 600 + +BASICFONTSIZE = 30 + + +def terminate(): + pygame.display.quit() + # sys.exit() + + +def checkForQuit(): + for event in pygame.event.get(QUIT): # get all the QUIT events + terminate() #terminate if any QUIT events are present + return + for event in pygame.event.get(KEYUP): # get all the KEYUP events + if event.key == K_ESCAPE: + terminate() # terminate if the KEYUP event was for the Esc key + return + pygame.event.post(event) # put the other KEYUP event objects back + + return False + + +def start(fen='', size=8): + global gameboard, font, DISPLAYSURF + + if not pygame.get_init(): + pygame.init() + + # Setting up the GUI window. + DISPLAYSURF = pygame.display.set_mode((WINDOWWIDTH, WINDOWHEIGHT)) + pygame.display.set_caption('Python Chess') + font = pygame.font.Font(pygame.font.get_default_font(), 48) + + checkForQuit() + + DISPLAYSURF.fill(BGCOLOR) + gameboard = board.Board(colors, BGCOLOR, DISPLAYSURF, size=size) + gameboard.displayBoard() + + if (fen): + gameboard.updatePieces(fen) + else: + gameboard.drawPieces() + pygame.display.update() + # FPSCLOCK.tick(FPS) + +def update(fen, winner): + global font, DISPLAYSURF + + checkForQuit() + gameboard.displayBoard() + gameboard.updatePieces(fen) + + if winner is not None: + if winner == 'White': + text_surface = font.render('White wins!', True, (50, 168, 82)) + elif winner == 'Draw': + text_surface = font.render('Draw!', True, (255, 255, 255)) + elif winner == 'Black': + text_surface = font.render('Black wins!', True, (168, 60, 50)) + + DISPLAYSURF.blit(text_surface, dest=(25, 25)) + + pygame.display.update() + # FPSCLOCK.tick(FPS) diff --git a/assignments/A2/chessboard/fenparser.py b/assignments/A2/chessboard/fenparser.py new file mode 100644 index 0000000..dd3825e --- /dev/null +++ b/assignments/A2/chessboard/fenparser.py @@ -0,0 +1,43 @@ +""" + https://github.com/tlehman/fenparser +""" + + +import re +from itertools import chain + + +class FenParser(): + def __init__(self, fen_str): + self.fen_str = fen_str + + + def parse(self): + ranks = self.fen_str.split(" ")[0].split("/") + pieces_on_all_ranks = [self.parse_rank(rank) for rank in ranks] + return pieces_on_all_ranks + + + def parse_rank(self, rank): + rank_re = re.compile(r"(\d|[kqbnrpKQBNRP])") + piece_tokens = rank_re.findall(rank) + pieces = self.flatten(map(self.expand_or_noop, piece_tokens)) + return pieces + + + def flatten(self, lst): + return list(chain(*lst)) + + + def expand_or_noop(self, piece_str): + piece_re = re.compile(r"([kqbnrpKQBNRP])") + retval = "" + if piece_re.match(piece_str): + retval = piece_str + else: + retval = self.expand(piece_str) + return retval + + + def expand(self, num_str): + return int(num_str)*" " diff --git a/assignments/A2/chessboard/images/bB.png b/assignments/A2/chessboard/images/bB.png new file mode 100644 index 0000000000000000000000000000000000000000..b066972f3249ce633eabcaeb7c42c8f31a2e54df GIT binary patch literal 905 zcmV;419tq0P)qP_) zId~EgEZ($!9z6LE1bPtZz2JdX)&D&g@Rcq6x^oS3b0#7i0p=V4cOVrj-n_iO3Q8(U>9&zQcGZB zh>>iF3sqIkTrOwk^Lf)IpU<1QT+V5l8Gr_C3o1tDi;N>ivK?1}9$=7=4wP=(#KY=T zEEdgTvFLRryAf2(mcVX!+?@@>@MCjNFe!45=w2$#%*^<)`7@9bNiN}i^YdEL9reIs zKjK*4E+=#%JWM|JAkb@h)M4$L7zRrCJ7YE5LrTCt86oZ10}caEM@L5w&Ckyhi^V)O zs#GdWOiZx2xVQ{V0qZ$;2Dxmw2M=S=@Ddl z8HhvU$&RaT!UEndQ>{+FFJwi?#>hZAon9Rp8j>h388ej2Wi(COA!S68aoV>b9_g&~My3%dQaf<{1i6Vw zp-y*PwF3#@3h)Z=>7bXuWvi_;epjtwtK&hd?RLbK7sPFG05|{~1C9b)>)QVU-T_O% zM?~Uc)p}O}ejprO0lomAeCl&V0WJUqt5ZK4U66P6r3^d)j>|X^2j1X+?uSvTz(X3p zuq(a5>xjiSD+@RzOq^mQjz~t^7)}OU_y&Bio(}^30c_OwJxDFC{^GPDmJx@+TZr|2 z8F&li5J6bB>h&TLbT)P-z6yM{>TV=~STGdCAP#JJw`R2iF^~x$1)M_%pmGg)^wU#3jw&Nw-aHuHS< zk9oOv^JT^w*>xujT;6DHa0BNqW{{nEhuKgl;;xfMy=zeedMK=Kj zfOt3qo(%WXn9jbRq+S?+MR0DQKF?imEBpq)Ujh6N&K~^%fCa!y0A~UGZo<7PFZ_Mu z`ur_`qX3=)cn_clz#9N&0RI4x10cZ57-!^95fKr#ZQHi7zP_G)eSI_7mhRWJgB_FJ8PTu3NW` z0NUVP=S)jsR#q1K`};|fMx&9ft*vZmXkb@Y7stoPNsB*~$nA-1)(v7w=X&z?Q=l;68|kMZ&GKLSXZt%${|SFg6&Y&H%K4zi%2 zfPx@=6i|40I1362_~5|5Ls1mDefxHw{ViXPygX=y2&b4p#YqD zo7epQ#EBCm$+);UpL-AhB@zkS+uP~p;lqcYEEe8cMn(onvZSPhaPB=`qu8)v!-ol# zXJuJgSso#4*RGwlpY!L>Qxrw2)#`ruxynB*Mk=jT<+LB-z;5NQp!;=R#B}6$b_eI5INA#Kgn_Or77&Na?9lr|1?F z85uceLXwk{sn_dix7(SQmp6`&^Esah2o4UeI&N%GaJSIo}N{-{Ag5V&H+3YL_V z@WO=)ynFX9U%Yt1H*el>czBp3X|Y(?-``KIR?GVOdY(RgnmcyvU~+Quq**{=VIeIR z3vD(V3kwS!0RH$nB0ORMlou5hiDt8zBw1Tq%l!O&*45QGt8qU@-8?l`G82$zf7b5^vwWO_J>G?PW$r#wdVqzl4a1 ze5X_@O|7l192prQN!n~SHa0f0w6v5N85xX@j`nKU#Ky*Q{rdGhc<>CN$%gjf7-wWL7+mRU`$L56$-_)iR9wNi&;@o z!LhM1c6WCZz<&6ciun4cMJ|)cOjfHEcDvmz4p~`QNJ~qDTCK*?rAwhyDiIPA@=4{< z(NT1FcSEPsL95k5qtT$bxfxcg6#x(#8j9fH;1P?(;`8d{vk(9#nM{VFq9SbCvHQHA5!|(F7j-%v@87>~pG|B&53Rt!K$9qno`S^0MC9h?B0W7FYPA|_wHi|C)TcdW zvl%*_4qaVc&}cNcbLS59dcEhmAP5$R!{PJLn$;YMkB`Uh-MdjxPylzjZ@1f_*XyCx zYVrE@YYYz$V|aKN4u=C0i3C!q6j4!8P%4#BtJR2$i$h?b^AM-IyBjq%HK?qt#M`%T z=Vp$aJ9o~r?ss%_@W_!PT(f4)l*4Q)lS-w`$;n|wMFn5JeCgSj%FD~g{4D~94jl^W z?CczU{`@&JGczY1hklj?1_m-OFHdZ2Y-CeY(}3TFxR3zY4xrB!$ma-}SXT>YPBrJR zIzj;a0YDXip-BRCObGPnzundc;2eNVINxr~nlE)6DZqIs;I?nzTo`1oPcwiY0hj>1 p0MHJg1Hf}Q14NpGx!O{}BdOe$XJm90{Xc%xS<5rfy#z64&$QujFU10Z1FC{0<> zFBnD>z}so%j{!d=>jd08dTXUA!ahhGcs^NvoqY&1P9KB6qIDYsKxv;pvk#XJ5(cgU zF90Ww!)!i%#-nEAX^}Z20@T~vtM>Nxhc1`vCh$7oJPzZTnjnYajJOA=y1H6BJ3Er3 zXf&$H$w{3(d-iW&h+_mg4QzAp7RnZJKpu}rLqkKFo12rVcs#C&i3$09zTbdnjvC@5 z@OzOES);A3P2q4j1$5`m9i2IIW*d0zC_yGoL!nSeu~qobpiX2gth=guh>i%F7h-MW>is;c@6@EsP!tLZ;JH8mwkT3A?+$K$cI zR??%tzdv?1bF%xmKMe1 zaY<5NU!Q>Y?0~2P)+ui`O71%|Gb2d~hrYUYx!rC7Pn82v z4{Tz6Hq3rgrS=U30;#RItE)@El|p9oovAMZ9>C#nIB+-|#a{vg!U22?d|paNfaT?7 z?%ur%KzDaH>>t{4st`!R@AnglL|9y0#P9bP z(0aHHJef9*3-|{M>#V!GJ9PmAfq;OQt$=vQb7aj3^LTrmgD1VKr2?4I+S-}|>Fn$j z@Rk)2cr>|?4`LGtW$FJkuz|&0&+T@nKn4Z|1dQi1n{TmyQJ`MQ&pwPiR=Vne?@8`@ z`3&UJ?(QxtD=PprH8lwcx@07x-um|WK~!jg?U=ht13?sqzYQT?5X2jbO-hNjq85T!h=qk#R%$2M_#(c5 zjW3|siG?5tqJXd*xpaOgV0k_Q@-CUVKq#yQ$;&SAIXnRg%s9_c92_xYXaa}d0zD(2beA7J>_{-86fOfCX4-? zaDVx8v;$Yfx7}JD0fj8g#<7NZfT&ipFk6pS;1yXlzIOc^{?O()k6kssG^SxfqidBK z96zYwK_y6c#^V8wC*%Pl|@Ul zNt$pOq7`^XzHcPygK)h#I}NWW2dI_$r=ohCqF;?@RW@CO7)mKXRBu3+)R^@2J0qRI zf&wrl9V87hO8Bp(&8T#MG{^|)ca<_QoaO`p@`ItRo}}g^73siTkMEQY$P2EG9_&oM zxZ9E=+;p1=JD3rYAZ1`*XsQwN2!eP#o`1q8;SzuddA#PL00000NkvXXu0mjfIe_`K literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/bQ.png b/assignments/A2/chessboard/images/bQ.png new file mode 100644 index 0000000000000000000000000000000000000000..9044de255ab2061c84a3706f4b97305a6a984b89 GIT binary patch literal 1797 zcmV+g2m1JlP)25o+55}3`3$kHur#&Q#+ zPJk0|3^<0fhkGwMzP{IgfNXozU!Zz!b0!`~w&=kof~olhDTR4djM^d#bH3fZk^iuOVIp9_j*I13D!c z8<3+kk;f{h;bm1jnNQ@voZL>yTtROk_?;GLw`x`$dzO zdSoGeY57c?>C5XT@SQStG(=3k%MjA{L#k~VFJg?MSoHyn19=0b&rOVJ_=(B&Zj3r{!_;uh*9p6c5gX(9t zFI8QQH+nuzOMIZ#Bs9p=-Z>q&*C0@N#(B$te@o(f4fwq}ALk@)VXH|1jPkU`^C~5$@(8`Cz00-oV}xR?FO6x-bAVGyaAV2xi?L8+g01|7;vv`ClR^fwSRR5cnRg! z>z!%SY`00ELgln+SN{?N6G}d)nR0F+l{V4Zg_318(fne%b(S9!61IWAD7ETV`C$Ab;=Sg zpU;!cX31nSq*5tTsT9d%lIiJba=Bb3-xX19BEJKErTu7bZf0{Z}Xo{rBX~xOc0O9xp(j0=D+>u(IZ1cE|&|x-;dw#XaD~FL?RJ-dV28r ze1LN2*4EbO@9!s(Nc;)-KFUnCV`w^i_G~(r%ZX?-Du#!Lg~#LBv4-||JYslwSVW^y zv9huv&YU@u#(00SBY4SbwXRbBIk4R!FN3N^wLPL?W_^AAy-Sxa{rbp}BQ>g4hg-L9 zSx%om{T?t=i{4gF8Y>+{>;(QBKFTf#cWQi8Yf#nBS{lARG&D3>Ute#zapQ*R%(PXw zTrQ3uKaSOE<;s;SUf`>0b!$q*YPH@d6bb{N%>OrU-Xs=_5s$}-$K%Y+&D9jR$KxRq zi4YEl>FevGx3?FY&Bo&5BCV~hzbq6A=bl9(2Y|mHIBgHW@xm?)oc3N6m@caFEyTf{*(_sYV_d&}oom;wasU4P z3^lyzswI)%I2?|jKY8+mLP2>mV6)jcc<>;RNQ6U&4iO9n@p`=k0s$NjhoO;NE=MYr zBArf?OeRSr62#+i?%usC+ud-vTzeK47QPA0*AQc6?Ay2RvyF`nF+V>qMn*=&$&)9A z)9EyASi9XW+-|q<`Fz6X^9i@xE$nu?sl3za6sJy|5+frcVt#&Jm;V?Fg)HH47*P6TYHEtxw{Me3B$%0*VRm+wxw$!nFkUcQEEYT-4}m~{j*gDa zB}yn1!e+A}gkW-VlB-v*u3ors;RTd8SUZ{sC`X*X@Or)9I&tE}o})*Pa`^CJ+S-Z_ z>(|!Sc>MS=4<9~cWn~2bhr@x}?WUojf%^LTBKdSW&G`5@u~>{~G`f*ar!y#Tv;JId zV6`Tqp$Yf_FaR9!cs!k~gFV`B-Ruj>~fpP*81pFumZO^OM?W)Ww${K1O<@t~T n{)KY3yRt)Z>|z(YFu{KSoHk;<254w&fp+S2F;vv)A`@y$OdOqS0zD5LgzL+h`^r7{-Z_FG2!bF8fr$cT z-~>4I;{@0N;#X)cbY=g0eErTPxn?!W(0~@;{S)tj2iIske_Zo*_kg$8XaY?v3@qRm z@YBz^HAlAv41qClA9xk!FB}%Llk)t}$R%TCRZB$$kp;&>E#9ES71v>0`IcoEM#8eJ zfu|75vId4>B*It%SL)O0bWzv!57B7&JLGga#kTDi!{PAbOid{SVg%gg-WHeSFKi`Boc|GlZ-|q8jVK3*=%kD-J3Y&Gr<0w zgD+_8`}x+oYu(zrlNb>rVnmFH5iuf0#K(NtyX(fDwRkklS?OYU6)p?^{`&A zXMpcFVPv!2Za?ey`>cA6@AZ1mflc6Zm`#F3*eDbVd&OcgABn8qQ}8^GPN#F&?RK|; z({ z!r9pwuInl{y$c)x$EIn1Q_<5hP4frv$$!qSDkBGq>SA6T$Q9*(G4gfIa|`smAjk3@ m;PD!beBu1hBS8>^Kl}zY)q$Y!m3syN0000!lvI6;>1s;*b3=DinK$vl=HlH+5@V=*uV@QVc+nc^z%?1K(4?TM;7|Q3J-^||s zK+T11*=(i456gc}cz^Rs!<0QULRKcud#+^8q3EHxz2>T>{O>($Qd@TEE-`IekjNng zBTfi^;rykuVuH5+g_x)eiKaG1OyZbq(Np=p`hxZ?b?y}{)huUU3M{c*TwK`tqI18n z`z_9f zIc0JBlR2r8V$xS-+uq!D-WTLm_J!xa|GpD!XZmdKI;Vst0QftC ATL1t6 literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/wB.png b/assignments/A2/chessboard/images/wB.png new file mode 100644 index 0000000000000000000000000000000000000000..71481c48a74f233070b9f6643796d1f8c9d38110 GIT binary patch literal 1475 zcmV;!1w8tRP)sHO8nh zMgevEUMY41+T7f%>2zAt>9p?Kx6gBCM`@+ajw68Hy?a+Z?%cWKIdWt^7Bur=6c`0a zr_&Q10|NtIb7Y>@oEKsuGQMuzI@{UVshypj8jHoOh>QcVQj41{hegC8mrm-o50zNc ztauIh9&iASL?RjvhrRl6+_6<9)HfsEH^yWDZE9-L?(Xi1V(;$m)~2Q=CATFH0L>-V znwPHtUAc0lbN>8!&BxiZXSKSz+Do}FORV`Nz5#U0mMu1wO67IJqpz<|H*VZ$naAz8 z7(M~Cp`k&u+3ZWAJ32bFqod=c{-L2E-MV$FS34h-*axbNF@tN?ta0*1A|8)xJRYBN zER{-WO-+sC*361hI`TE37cXASn?`kYby`*ejw^c$Xt95dea#5v$ggOfKVtj?M`K_WpHpXCqU%3s(yfv`T&2$?s3yv zdm8u*V8ezDl$DhgoG?B<&ef||0Z`Qrd^#~#G>C}Zym_KB-?kn&+ zrFH@lxl&P4;XHWoVAh3x|Neaq1OkqT{Nh)K-_#1L>dsg!#;H@MiZT$3#Y|66&u(Bj zFyvED(R_$|x}AgT13yCiMkEMu{P=P9?AcS4flHSzv48)5fPhaezSse1C=}AJt}b;P zXU6s6IF4Sqaz%r|pcj$2A0cz`9BCDiL#nzo8jafR+qawA+FI7GT}xF}6%`c~0A#aS z`uqF2ckdp_WRk9~F5B1FXN)nU*4l%>w{xJyH&ws^5&3QM*TsC7h&Up04fxcZ>zmm| zq{dyi(w(~$SmusJfH3enut7xLQq{#TEGF_yRc`=)0QZ1F!28lY3j9OP*#Y2h;IG*_ zln(=Z4E$+~8Dxe#P%s#@d-v|uW5(=1)NVbV3V7 zBqSo8s=8(Q^5r&>NSO8O*AtCKsjRF7AP@*pUS5uf5DtflL?WzSy_)Lk>Ioy6Oa_2( zI6TppN~L)8=n?63noK5xsxme<#_;ekkoybb$&)Aa^z?B3`gN?e7WfWm1)j~ukunka zRaLjPwzksN*2cq!4@oAIJbn6fLR@)yIf20QT{D}_GCn?zwU)<^A9M5OO|D(L2Eev$ z+la^GM59rRF)UiNh+r@{F?V=)c;am{91gQ$#R_U`YXLZL-~g8|Uk2y`-UV!d0K7m5 zH@rJ{?$l5yG;IM-b&1Fja09sEwr6c46bd;F4Goj~B2x)2lv>+FUB@2anx*CsRdk!!YjJ;Ynjd?mWo-kX69jz-AGN0e`6KLEyInnip7L dfdyU>{sZbRS)XpmBW(Zx002ovPDHLkV1la-%Q^r6 literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/wK.png b/assignments/A2/chessboard/images/wK.png new file mode 100644 index 0000000000000000000000000000000000000000..685abbf012a7d60f6bb566137313853486a9ade3 GIT binary patch literal 1910 zcmV-+2Z{KJP)g*n} zV6~TXAS2FxiXfs^B3o!#3Poz&TBsz5jLv=tKiHZS6;`xj?t(e3)>!CT?)Wl|ra8~G zALa#1Jf#S}jgF~0P(=O4ZlQKBO40GRU`d_;_I zfgZpKjQWz(_w3t9IE++_JOds92H-2-vws2}-@BhB&At>-v`9PnTtr&PTwsF(|pi^bwmN;!e)Uph#DL?9WMG0FR_fSf*kT0W$rqC)Vt%5NtqX9DKqT|h$~yTKNi z2mD#nGzZ>=?HSF|( z2d)9@02NGt!7PY-lu{LdF)J%eva_=>o6Yp}^w8AQl+x7H^u37uUMY1~L=FLNfPsO5 zafbT(`uw*>pjs)lRYa84YL)ElY&B=j97aY)Xm4+yaqHHt-wX~8exsCX5Rsk0e}WM- z8AX7krlxuxJa{m!tB8nnc6LfhNr}Y9#(Dr9xDH5FRn@q>7cX8EKr~Hzt7)3-*|SGl zTU#fz>vFl|$dMyrFc@@A)BXo!hAZNiN~yt=loZdaSFa{?HkKDJUPyj^zJIEf!otFF zd9t&!1(5mk=j#m(4Ii~BB2rURBSxc9*EH<~Ff$w>e+A^mjT=EZ6cO=wJaXvJAps;R zDoVyyz}d5B1(2mnmr7SxSI{;^M9!Z-@1G?85~>K3QtHi$6)Qq==%=)_Q~S5pvU~ULPpU-`3AD(kpzFHWY&MUk zX&nT)K#t{y=;&yDvU&b<3aP59^4kfkS%0OJ@+@1nOn1B8Urb1IbF-LCCSB9CPA1>q zeUyWMY~H+C1_uW}yAZqGE_3J3^(dv@^8S8q93Sg%3iuoFU0z-u)z#HlESC2&csw2& z8yjh8XyD0{C)n+F91aIAmy5x{L0m2uF)=YDCMFUW7e`7;3RbI?#fuk{o105UMg~fa z598jwdu-XVMeptH6%pA1Tn@heCl~W4Ku=0a@?5%fN#4DCCs(gtm4bo-nK^T2pw!0*yLPRdIB`Pm+_@vKU%w8j%XD^jN_~C396fqe zR<2wr27^KHZcb(1ym>m_{aPci_@@@(Ck0mkohVVyLNj*e1ZUe1*( zS9tjFAs&w>5NLXOI{Eqe#Ky)F7Z-=gWMXJ&i2nY5+-^7R?d@E@ew}OAt^r^)8p+AY zp|G&fZ(a{4rcj9o0$m^}DM@zi+9j7RU6SX|pZ{q0`LNqPefm_+ojWJnwr!L6_;~T# z^-Z-AC&BOV!i5X+_U+pV1MTVQk+!xrX=-YcM~@y!b91w_wY5oKU*ClJ2L=YDqM|~k zPoFM$54O#ZB1eHMgfRt&BgBsp_%-m2rfFa6x*j;HnKo^j#Kpx) zLPCN{NJvnDDgd9YIBx*(W8fO4lw;cvTSSaxWMnWuKVJzUGyvs+^GyJF=FAy7ole3p zv}e1542J=$)v65*4bf;cYVZgAD*zT16)B(3N0-Z`i*y5U0C*RGar;6J&Nl#f7xf`9ys1Na2nD6~gPIlq7Zeih1sq_+CR%aK_vi>|INy@S5p42cvW#Hh(+(mWmyNpfOhf)_4apx5gS8Qk359IL9T*w@z= zmP}1e4TTU(0P^B3;sn6+=g&vg%lGcxBLKQwuCVSO85yC$U{CeML)2EH|3B3}aF)vH&dk{BBsquFex)oP8X+~DA#K32YnheU>y zayl4_>EB-!8JuV>`bXgUHyhyk0;rcF;zlO(-f@A6-)y}g~IqodrpbEhVR zm<3Q3q>6kg!?Hk)C1sw0|)4GxoEfBmqpxeH;apl^=+VF z5}87X(H%Q>sDXijs3mlgl9CksJ26qyEQFZX1@z<4p+oxbvq8$F0q6t3%aV5py6=j$Pr2@U&K>nJp}w~2Ra;%xC!VSJ$jTvh=r{XaR8v*ZjWmw zbWWT&p^wQ;C0$B6vv==awYV5^vm`1`o;<0GnAZy;9$S?kE2UoR=;%Ola&jE1TZ_@S zyzjm4vLj{@A;j_ByLYR~%F1p1Iu&c}x`QyPSL;<|02S^z`F(QBuJ3p|IEL;XNHF^SLt#90000< KMNUMnLSTXiD$bq& literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/wP.png b/assignments/A2/chessboard/images/wP.png new file mode 100644 index 0000000000000000000000000000000000000000..ca398a514d4653759d2757796a6387408b8dcdf5 GIT binary patch literal 988 zcmV<210(#2P)Oc?|$EJ?)lC=cOWDrBqSsx1XZQ$HUJ+2_kkCIP2g+b8^EqoPUGaX)=vOQ zBoaEX(SSH=jP_bwrvp+IX*s?@$qp{N{LeH7pk`s zj4=er{QSI>V`OAR00G{sah=cQ`$Qt)cz5D5rBcZgnKPYO8@}F4sZ>hU)zy_9OeT{= zqfwy>ePUWz1`7TKjs!a96tbLX=%x? zhlq&G%*=Rq-QAV0t}bue{nK;-m68I! zhex8yg#BG8ymdo4}Vq+&~Q#lT}JR0c2=sNJ^!WuO2BB3ew--FPy!{ z{|+?OQX;9feyX*Wg@pxQ0+$&Z8}np-rA7xx1^fV9Tf$>>bkysaFKQw35$DUPQXI#T zo}M00rt>BxVp{7$I-Pcoj*co85fRzh*^ziW?wt3_jh%)+0c3G;(TIe{2x}1jzDCyS*?_MHE3KAktRSjHC6XmluRZ8l0oBwY(1|5j{zDR z8{Oy3y*7J$d)|+G7dY`7cPBs&7x?KsS%9!>bB6#TAt53E6aE1ysGJ^~koH*s0000< KMNUMnLSTZ5x!o54 literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/wQ.png b/assignments/A2/chessboard/images/wQ.png new file mode 100644 index 0000000000000000000000000000000000000000..933f3d29642e6f2e02bb0efb127079150102e47d GIT binary patch literal 2288 zcmVAF{jI4-`FYp1WQ^S}vgak=}wyHXHtqSbJBp7V_KnSX~jwmmE z%UXv<crWzXLWphTq`Rp6ULZ-Wr(-c7&8PUMC4Q82iILe3iklo)zzire$$r zE#zgllZbri^ZBe7UU)(G?AfC}pU)DJ^cvX%=qI0iqN=Lzz4x9St7{>MdVwC`0Pqq} znP%Sz=+>=U^~8x2x^w4FJ9&GW-z~hX9ipg)7}78l7|vc!AZ<@0nFpCvAzEg9?wJRXk~ zkH=M2_3gLcwtXMCnve<+iLYI|*6Q!?*Zc0f&z{tsL&z&x;=SSWc_WKYXAU7ffNtBi zP5b-%wW+De5|J2i)769kJRu@+S8yeBaXCUn*W@-UUBoZMKiP*VX(tLIS zJoZ@nR0n0L+@!d?1Dws|m`#X{KLc2nwUV?A&qir!DciSi7vK)yJ1$cMptZG?*4EZ} zV=1f?FpNVedeuHjY@Ash}94u=sD znBOuVR@K0+UAwa7z8iQrmD}Nx4Y`C20`&Cs5C{Y;W6XXaknXf;(qBp3`*TU)Cl;?#qPbT41N+-h%6KM(*AFvjc;1Oir1PtQCq*D7QPU}|cL zy?gf>%d*yx+z97EMCj`363enyk=)>xs_M;=NW|GFBaw)^;5Vr1+8sM~n39r`OnG}P z%UZK{?_M)CH8qdRwFlIH|y80R}p!J47+MaM+Y8{$1ZxO&|O08d@aB( z5#jO2ztKe@xg?)izka=TcXu;1G=wqc0&wx$2*I+f!NI{n%j5Cz+H0?g$Kw$Zd7b&k zamvff*|KGe06zq_0rQI3_5B_ZY1_DQBTY?B>FJ6@RdqjqdOu&40?=c}j;X5Z%*>27G&IakA+?>+6%^;^b+^&Pk4r1^K;2xdHfh zdwV;mF470PdBoYZOU%m{$^5x6%csvvr7gJJF zf`||d2J!iPtXj3oS%Lu1KmRgFDw(0PesJK>#n~w#7e!aOMiaJibCK0HUeJ&Qdd_;U0ofkSFfh5tPH>3PcRq+ z{#)clMMX~GPfbm6<;oReu^3-}{WSoSlatKN%`q`C!MStiIDPswUw-+eo$I^6sRH>G zgkJ#K*Vnh;b+Lc{e)|snv`|v{b}ctf0$jRu$r(6z?i^!dW6m!;Jw5GQ?Uw5E`J6ko zWXTfe4pvrHvU>Gu04`p1wu%q0fmgx!EuhWK&01eyuYSM(Ti1u*@7MbJdTnlQw#QyC zlvJTL(gOSqkWeVZnl)>vs;Z*8x|-_hYJ$O_)0Ny;Rb_5&&go|MH5!dFIy%b8$cS@w z-RWvzv`|5LK}1gY{r<%J@4vs`^b7`Q>#HL9%1%jvYI$n+O{zA(wLSnTLE% zzczj>B0TiaLxse@CWOOb3kZ=sEartmgw&Oklvs6jbp;bE6rG)&Hm~pHJExFhzgI*K ztEvfwLRLjZg|S;_RaF%?-gqNkuh(gk60|`6uI4+&!1;>bku3#2AGV!#A2228PtMJ!?wx$qwi)=X0c>DNR60000< KMNUMnLSTYz({Pdi literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/wR.png b/assignments/A2/chessboard/images/wR.png new file mode 100644 index 0000000000000000000000000000000000000000..6cce1bfa70b9fa6e8d2b450f15d318dd4d3ad342 GIT binary patch literal 1043 zcmV+u1nm2XP)MESc?RRoiw}AW<%oeXOTGVCq2RL4#R%$n|brz zK!^|_LWBqrVrpo>A@BzH#Tjpar$F>SY+SoT=Q)o3(+R%3Hi6+C;FYfHlF4Kwl}ZU9 zz)!$?ew%bUE!k{V(&@D5x-P&g=Q+S*-~}M5R7x_L%p{v&iR5xQ5fSP4`%)|xT{16$ z?}6ul#J9Vwxs^a&MTX zDbCkJuMfj8h{a+Hnc=x`etypB=_%v!7^M^@oJ0GlOa8+ctVm!;iq&!k4X-Ij8> zEWm5W-~XL_waDeS5A+r^DLu#ELy@C=_w0q$k!9qhPX+f=7FrOONJ8@w5@5UvMEoQo z9y0hBg;h|*CE<>hBjQyg;=HR@5pC6oxFMyjsv>?unop5`ROq(?tDuOxE4F>h@5+Rh zcxr{_dGTNhqGefhyIrEuC?Yb=7MgCii)C345%CtjK$6`AlC@fm{r!D3ZTfVxZJTDZ z39#k(`(pwb+jl*Y$UJxg43CeGWjr3wwEG7Dp{nTmPJyc7y zMO1bLyc>_l+1uO0FpQ~^d{WX|mc_-z1)Wak{eP)#G9gFiR^&18qEIM^Wm&QaSe7M) zLc!m9o%-zkR$!Wj!PmfN&Tl>fKG@#gCYemm-41HCT3laW19XAkov`^4_$CM$14t9+l~ML N002ovPDHLkV1gdQ?%DtV literal 0 HcmV?d00001 diff --git a/assignments/A2/chessboard/images/wtile.png b/assignments/A2/chessboard/images/wtile.png new file mode 100644 index 0000000000000000000000000000000000000000..467cad32e89d7ca0c46b2969a5121ed1187af095 GIT binary patch literal 208 zcmeAS@N?(olHy`uVBq!ia0vp^Mj*_=1SBWM%0B~AjKx9jP7LeL$-D$|SkfJR9T^xl z_H+M9WCij$3p^r=85sBugD~Uq{1quc!BkHd$B+p3x0f~wG8k|iG58iQl@{Rs@Jf6^ zS9<)u%F3%{)BbozWp*~?WNYgRPRPw&s>-x!?bM!=^>Q9uhBJYD@<);T3K0RUOnMN