#!/usr/bin/env python
#
# tournament.py -- implementation of a Swiss-system tournament
#
# Allows recording of tied matches.
# Matches opponents of relative standings.
# Pairs players in unique matches.
#
# TODO: implement match byes
# TODO: implement pairing for odd number of players
# TODO: implement Opponent match win tie breaker algorithm
# TODO: implement tournament tracking
#

import psycopg2


def connect():
    """Connect to the PostgreSQL database.  Returns a database connection."""
    return psycopg2.connect("dbname=tournament")


def deleteMatches():
    """Remove all the match records from the database."""
    dbh = connect()
    sth = dbh.cursor()
    sth.execute("TRUNCATE TABLE matches")
    dbh.commit()
    dbh.close()


def deletePlayers():
    """Remove all the player records from the database."""
    dbh = connect()
    sth = dbh.cursor()
    sth.execute("TRUNCATE TABLE players CASCADE")
    dbh.commit()
    dbh.close()


def countPlayers():
    """Returns the number of players currently registered."""
    dbh = connect()
    sth = dbh.cursor()
    sth.execute("SELECT count(players) FROM players")
    result = sth.fetchone()
    dbh.commit()
    dbh.close()

    return result[0]


def registerPlayer(name):
    """Adds a player to the tournament database.

    The database assigns a unique serial id number for the player.  (This
    should be handled by your SQL database schema, not in your Python code.)

    Args:
      name: the player's full name (need not be unique).
    """
    dbh = connect()
    sth = dbh.cursor()
    query = "INSERT INTO players (name) VALUES (%s)"
    values = [name]
    sth.execute(query, values)
    dbh.commit()
    dbh.close()


def playerStandings():
    """Returns a list of the players and their win records, sorted by wins.

    The first entry in the list should be the player in first place, or a player
    tied for first place if there is currently a tie.

    Returns:
      A list of tuples, each of which contains (id, name, wins, matches):
        id: the player's unique id (assigned by the database)
        name: the player's full name (as registered)
        wins: the number of matches the player has won
        matches: the number of matches the player has played
    """
    dbh = connect()
    sth = dbh.cursor()
    query = '''
        SELECT * FROM standings
        '''
    sth.execute(query)
    result = sth.fetchall()
    dbh.commit()
    dbh.close()
    return result


def reportMatch(winner, challenger, tied=None):
    """Records the outcome of a single match between two players.

    Args:
      winner:  the id number of the player who won
      challenger:  the id number of the player who lost
    """
    dbh = connect()
    sth = dbh.cursor()
    query = "INSERT INTO matches (winner_id, challenger_id, tie) VALUES (%s, %s, %s)"
    values = [winner, challenger, tied]
    sth.execute(query, values)
    dbh.commit()
    dbh.close()

def getPlayerOpponents():
    """Returns list of opponents for all players

    Returns:
      A list of tuples, each of which contains (id, list)
        id: player's unique id
        list: list of opponent id
    """
    dbh = connect()
    sth = dbh.cursor()
    query = '''
        SELECT
            opponents.id,
            array_agg(challenger_id) AS challenger_id_list
        FROM opponents
        GROUP BY opponents.id
        '''
    sth.execute(query)
    result = sth.fetchall()
    dbh.commit()
    dbh.close()

    return result

def getStandingGroups():
    """Returns a list of standings grouped by win, tie, loss

    Assuming standings are provided ordered by (win, match, tie), each standings
    group contains players with equivalent standings

    Returns:
      A list of sets of tuples, each of which contains (id, name)
        id: player's unique ID
        name: player's name
    """
    standings = playerStandings()

    standings_groups = []
    group = set()
    # set initial standings
    (win, match, tie) = standings[0][2:5]
    for player in standings:
        # test if player standings does not match current standings
        if ((win, match, tie) != player[2:5]):
            # append current player group to the standings group
            standings_groups.append(group.copy())
            # set new standings
            (win, match, tie) = player[2:5]
            # reset group
            group.clear()
        # add (player id, player name) to group of players
        group.add(player[0:2])
    # add last group to standings_groups
    standings_groups.append(group.copy())

    return standings_groups

def swissPairings():
    """Returns a list of pairs of players for the next round of a match.

    Assuming that there are an even number of players registered, each player
    appears exactly once in the pairings.  Each player is paired with another
    player with an equal or nearly-equal win record, that is, a player adjacent
    to him or her in the standings.

    Returns:
      A list of tuples, each of which contains (id1, name1, id2, name2)
        id1: the first player's unique id
        name1: the first player's name
        id2: the second player's unique id
        name2: the second player's name
    """

    # reduce opponents to a dictionary of player_id and the set of their
    # previously played opponent_id
    opponents = {}
    for (id, cid_list) in getPlayerOpponents():
        opponents[id] = set(cid_list)

    standings_groups = getStandingGroups()

    pending_players = set()
    pending_players.update(set(standings_groups.pop(0)))
    pairs = []
    player = None
    challenger = None
    while len(pending_players) > 0:
        player = pending_players.pop()
        # if no more pending players add players from next group
        if len(pending_players) == 0 and len(standings_groups) > 0:
                pending_players.update(set(standings_groups.pop(0)))

        challenger = pending_players.pop()
        if len(pending_players) == 0 and len(standings_groups) > 0:
                pending_players.update(set(standings_groups.pop(0)))

        if challenger[0] in opponents[player[0]]:
            new_challenger = pending_players.pop()
            pending_players.add(challenger)
            challenger = new_challenger

        pairs.append((player[0], player[1], challenger[0], challenger[1]))

    return pairs


#!/usr/bin/env python
#
# tournament.py -- implementation of a Swiss-system tournament
#
# Allows recording of tied matches.
# Matches opponents of relative standings.
# Pairs players in unique matches.
#
# TODO: implement match byes
# TODO: implement pairing for odd number of players
# TODO: implement Opponent match win tie breaker algorithm
# TODO: implement tournament tracking
#

import psycopg2


def connect():
    """Connect to the PostgreSQL database.  Returns a database connection."""
    return psycopg2.connect("dbname=tournament")


def deleteMatches():
    """Remove all the match records from the database."""
    dbh = connect()
    sth = dbh.cursor()
    sth.execute("TRUNCATE TABLE matches")
    dbh.commit()
    dbh.close()


def deletePlayers():
    """Remove all the player records from the database."""
    dbh = connect()
    sth = dbh.cursor()
    sth.execute("TRUNCATE TABLE players CASCADE")
    dbh.commit()
    dbh.close()


def countPlayers():
    """Returns the number of players currently registered."""
    dbh = connect()
    sth = dbh.cursor()
    sth.execute("SELECT count(players) FROM players")
    result = sth.fetchone()
    dbh.commit()
    dbh.close()

    return result[0]


def registerPlayer(name):
    """Adds a player to the tournament database.

    The database assigns a unique serial id number for the player.  (This
    should be handled by your SQL database schema, not in your Python code.)

    Args:
      name: the player's full name (need not be unique).
    """
    dbh = connect()
    sth = dbh.cursor()
    query = "INSERT INTO players (name) VALUES (%s)"
    values = [name]
    sth.execute(query, values)
    dbh.commit()
    dbh.close()


def playerStandings():
    """Returns a list of the players and their win records, sorted by wins.

    The first entry in the list should be the player in first place, or a player
    tied for first place if there is currently a tie.

    Returns:
      A list of tuples, each of which contains (id, name, wins, matches):
        id: the player's unique id (assigned by the database)
        name: the player's full name (as registered)
        wins: the number of matches the player has won
        matches: the number of matches the player has played
    """
    dbh = connect()
    sth = dbh.cursor()
    query = '''
        SELECT * FROM standings
        '''
    sth.execute(query)
    result = sth.fetchall()
    dbh.commit()
    dbh.close()
    return result


def reportMatch(winner, challenger, tied=None):
    """Records the outcome of a single match between two players.

    Args:
      winner:  the id number of the player who won
      challenger:  the id number of the player who lost
    """
    dbh = connect()
    sth = dbh.cursor()
    query = "INSERT INTO matches (winner_id, challenger_id, tie) VALUES (%s, %s, %s)"
    values = [winner, challenger, tied]
    sth.execute(query, values)
    dbh.commit()
    dbh.close()

def getPlayerOpponents():
    """Returns list of opponents for all players

    Returns:
      A list of tuples, each of which contains (id, list)
        id: player's unique id
        list: list of opponent id
    """
    dbh = connect()
    sth = dbh.cursor()
    query = '''
        SELECT
            opponents.id,
            array_agg(challenger_id) AS challenger_id_list
        FROM opponents
        GROUP BY opponents.id
        '''
    sth.execute(query)
    result = sth.fetchall()
    dbh.commit()
    dbh.close()

    return result

def getStandingGroups():
    """Returns a list of standings grouped by win, tie, loss

    Assuming standings are provided ordered by (win, match, tie), each standings
    group contains players with equivalent standings

    Returns:
      A list of sets of tuples, each of which contains (id, name)
        id: player's unique ID
        name: player's name
    """
    standings = playerStandings()

    standings_groups = []
    group = set()
    # set initial standings
    (win, match, tie) = standings[0][2:5]
    for player in standings:
        # test if player standings does not match current standings
        if ((win, match, tie) != player[2:5]):
            # append current player group to the standings group
            standings_groups.append(group.copy())
            # set new standings
            (win, match, tie) = player[2:5]
            # reset group
            group.clear()
        # add (player id, player name) to group of players
        group.add(player[0:2])
    # add last group to standings_groups
    standings_groups.append(group.copy())

    return standings_groups

def swissPairings():
    """Returns a list of pairs of players for the next round of a match.

    Assuming that there are an even number of players registered, each player
    appears exactly once in the pairings.  Each player is paired with another
    player with an equal or nearly-equal win record, that is, a player adjacent
    to him or her in the standings.

    Returns:
      A list of tuples, each of which contains (id1, name1, id2, name2)
        id1: the first player's unique id
        name1: the first player's name
        id2: the second player's unique id
        name2: the second player's name
    """

    # reduce opponents to a dictionary of player_id and the set of their
    # previously played opponent_id
    opponents = {}
    for (id, cid_list) in getPlayerOpponents():
        opponents[id] = set(cid_list)

    standings_groups = getStandingGroups()

    pending_players = set()
    pending_players.update(set(standings_groups.pop(0)))
    pairs = []
    player = None
    challenger = None
    while len(pending_players) > 0:
        player = pending_players.pop()
        # if no more pending players add players from next group
        if len(pending_players) == 0 and len(standings_groups) > 0:
                pending_players.update(set(standings_groups.pop(0)))

        challenger = pending_players.pop()
        if len(pending_players) == 0 and len(standings_groups) > 0:
                pending_players.update(set(standings_groups.pop(0)))

        if challenger[0] in opponents[player[0]]:
            new_challenger = pending_players.pop()
            pending_players.add(challenger)
            challenger = new_challenger

        pairs.append((player[0], player[1], challenger[0], challenger[1]))

    return pairs


#!/usr/bin/env python # # tournament.py -- implementation of a Swiss-system tournament # # Allows recording of tied matches. # Matches opponents of relative standings. # Pairs players in unique matches. # # TODO: implement match byes # TODO: implement pairing for odd number of players # TODO: implement Opponent match win tie breaker algorithm # TODO: implement tournament tracking # Connect to the PostgreSQL database.  Returns a database connection. Remove all the match records from the database. Remove all the player records from the database. Returns the number of players currently registered. Adds a player to the tournament database.      The database assigns a unique serial id number for the player.  (This     should be handled by your SQL database schema, not in your Python code.)      Args:       name: the player's full name (need not be unique). Returns a list of the players and their win records, sorted by wins.      The first entry in the list should be the player in first place, or a player     tied for first place if there is currently a tie.      Returns:       A list of tuples, each of which contains (id, name, wins, matches):         id: the player's unique id (assigned by the database)         name: the player's full name (as registered)         wins: the number of matches the player has won         matches: the number of matches the player has played SELECT * FROM standings Records the outcome of a single match between two players.      Args:       winner:  the id number of the player who won       challenger:  the id number of the player who lost Returns list of opponents for all players      Returns:       A list of tuples, each of which contains (id, list)         id: player's unique id         list: list of opponent id SELECT             opponents.id,             array_agg(challenger_id) AS challenger_id_list         FROM opponents         GROUP BY opponents.id Returns a list of standings grouped by win, tie, loss      Assuming standings are provided ordered by (win, match, tie), each standings     group contains players with equivalent standings      Returns:       A list of sets of tuples, each of which contains (id, name)         id: player's unique ID         name: player's name # set initial standings # test if player standings does not match current standings # append current player group to the standings group # set new standings # reset group # add (player id, player name) to group of players # add last group to standings_groups Returns a list of pairs of players for the next round of a match.      Assuming that there are an even number of players registered, each player     appears exactly once in the pairings.  Each player is paired with another     player with an equal or nearly-equal win record, that is, a player adjacent     to him or her in the standings.      Returns:       A list of tuples, each of which contains (id1, name1, id2, name2)         id1: the first player's unique id         name1: the first player's name         id2: the second player's unique id         name2: the second player's name # reduce opponents to a dictionary of player_id and the set of their # previously played opponent_id # if no more pending players add players from next group