Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Whoever-Pick-The-Last-One-Lose: ×5 Board

    Uploaded by

    Hello mister
    The document describes a whoever-pick-the-last-one-lose game played on a 5x5 board where two players take turns removing pieces in rows or columns until one player is forced to take the last piece and loses. The program must evaluate board configurations from the game by outputting "winning" if the current player has a move that will force their opponent to take the last piece, or "losing" otherwise. Evaluating whether a configuration is winning early can greatly reduce the search time of the game tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Whoever-Pick-The-Last-One-Lose: ×5 Board

    Uploaded by

    Hello mister
    16 views2 pages
    The document describes a whoever-pick-the-last-one-lose game played on a 5x5 board where two players take turns removing pieces in rows or columns until one player is forced to take the last piece and loses. The program must evaluate board configurations from the game by outputting "winning" if the current player has a move that will force their opponent to take the last piece, or "losing" otherwise. Evaluating whether a configuration is winning early can greatly reduce the search time of the game tree.

    Original Description:

    Uva coding problem

    Original Title

    682

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a whoever-pick-the-last-one-lose game played on a 5x5 board where two players take turns removing pieces in rows or columns until one player is forced to take the last piece and loses. The program must evaluate board configurations from the game by outputting "winning" if the current player has a move that will force their opponent to take the last piece, or "losing" otherwise. Evaluating whether a configuration is winning early can greatly reduce the search time of the game tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    16 views2 pages

    Whoever-Pick-The-Last-One-Lose: ×5 Board

    Uploaded by

    Hello mister
    The document describes a whoever-pick-the-last-one-lose game played on a 5x5 board where two players take turns removing pieces in rows or columns until one player is forced to take the last piece and loses. The program must evaluate board configurations from the game by outputting "winning" if the current player has a move that will force their opponent to take the last piece, or "losing" otherwise. Evaluating whether a configuration is winning early can greatly reduce the search time of the game tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    682 Whoever-pick-the-last-one-lose

    Consider the following whoever-pick-the-last-one-lose game. The game is played on a 5×5 board.
    Initially every array cell has a piece in it. Two players remove pieces alternatively from the board.
    The player can remove any number of consecutive pieces in a row or column. For example, in the
    configuration depicted below where one indicates a piece, the player can either remove one piece (A1,
    A2, or B1), or remove two pieces (A1 and A2, or A1 and B1) simultaneously. The game ends when
    one player is forced to take the last piece, and the other player wins the game.

    1 2 3 4 5
    A 1 1 0 0 0
    B 1 0 0 0 0
    C 0 0 0 0 0
    D 0 0 0 0 0
    E 0 0 0 0 0

    Write a program that evaluates board configurations from this game. The program must output
    ‘winning’ when there exists a winning move that no matter how the opponent responds, it will force
    the opponent to take the last piece. Otherwise, the program must output ‘losing’.
    Note that during the game tree evaluation, if the current configuration has a winning move, then it
    is not necessary to search any further because the configuration is guaranteed to be winning. This can
    greatly reduce the game tree search time.

    Input
    The input file contains 5c + 1 lines.

    Line 1 c the number of configurations


    Lines 2-6 ... configuration #1
    ... ...
    Lines 5c − 3 to 5c + 1 ... configuration #c

    Output
    The output contains c lines.

    Line 1 evaluation result of configuration #1


    ...
    Line c evaluation result of configuration #c

    Sample Input
    3
    1 1 0 0 0
    1 0 0 0 0
    0 0 0 0 0
    0 0 0 0 0
    0 0 0 0 0
    Universidad de Valladolid OJ: 682 – Whoever-pick-the-last-one-lose 2/2

    1 1 0 0 0
    0 0 0 0 0
    1 1 0 0 0
    0 0 0 0 0
    0 0 0 0 0
    1 1 1 0 0
    1 0 0 0 0
    0 0 0 0 0
    0 0 0 0 0
    0 0 0 0 0

    Sample Output
    winning
    losing
    winning

    You might also like