Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    Strategy: Input

    Uploaded by

    xyz
    The document describes a psychology experiment where players can either trade or cheat in a game. It then discusses simulating different strategies for the game by having automatons represent each strategy. The automatons have a program, memory of past encounters, and a score. The document provides a grammar for writing programs to represent strategies and sample programs. It describes an input file format for up to 10 strategies and the output format which will print each strategy's final score.

    Copyright:

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

    Strategy: Input

    Uploaded by

    xyz
    34 views2 pages
    The document describes a psychology experiment where players can either trade or cheat in a game. It then discusses simulating different strategies for the game by having automatons represent each strategy. The automatons have a program, memory of past encounters, and a score. The document provides a grammar for writing programs to represent strategies and sample programs. It describes an input file format for up to 10 strategies and the output format which will print each strategy's final score.

    Original Description:

    uva problem 174

    Original Title

    174

    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 psychology experiment where players can either trade or cheat in a game. It then discusses simulating different strategies for the game by having automatons represent each strategy. The automatons have a program, memory of past encounters, and a score. The document provides a grammar for writing programs to represent strategies and sample programs. It describes an input file format for up to 10 strategies and the output format which will print each strategy's final score.

    Copyright:

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

    Strategy: Input

    Uploaded by

    xyz
    The document describes a psychology experiment where players can either trade or cheat in a game. It then discusses simulating different strategies for the game by having automatons represent each strategy. The automatons have a program, memory of past encounters, and a score. The document provides a grammar for writing programs to represent strategies and sample programs. It describes an input file format for up to 10 strategies and the output format which will print each strategy's final score.

    Copyright:

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

    174 Strategy

    A well known psychology experiment involves people playing a game in which they can either trade
    with each other or attempt to cheat the other player. If both players TRADE then each gains one
    point. If one TRADEs and the other CHEATs then the TRADEr loses 2 points and the CHEATer wins
    2. If both CHEAT then each loses 1 point.
    There are a variety of different strategies for playing this game, although most people are either
    unable to find a winning strategy, or, having decided on a strategy, do not stick to it. Thus it is fairer
    to attempt to evaluate these strategies by simulation on a computer. Each strategy is simulated by
    an automaton. An automaton is characterised by a program incorporating the strategy, a memory for
    previous encounters and a count reflecting the score of that automaton. The count starts at zero and
    is altered according to the above rules after each encounter. The memory is able to determine what
    happened on up to the last two encounters with each other contender.
    Write a program that will read in details of up to 10 different strategies, play each strategy against
    each other strategy 10 times and then print out the final scores. Strategies will be in the form of simple
    programs obeying the following grammar:

    < program > ::= < statement >.


    < statement > ::= < command > | < if stat >
    < if stat > ::= IF < condition > THEN < statement > ELSE < statement >
    < condition > ::= < cond > | < cond > < op > < condition >
    < op > ::= AND | OR
    < cond > ::= < memory > {= | #} {< command > | NULL}
    < memory > ::= {MY | YOUR} LAST {1 | 2}
    < command > ::= TRADE | CHEAT

    Note that LAST1 refers to the previous encounter between these two automata, LAST2 to the
    encounter before that and that ‘MY’ and ‘YOUR’ have the obvious meanings. Spaces and line breaks
    may appear anywhere in the program and are for legibility only. The symbol ‘#’ means ‘is not equal
    to’. NULL indicates that an encounter has not ocurred. The following are valid programs:

    CHEAT.
    IF MY LAST1 = CHEAT THEN TRADE ELSE CHEAT.
    IFYOURLAST2=NULLTHENTRADEELSEIFYOURLAST1=TRADETHENTRADE
    ELSECHEAT.

    Input
    Input will consist of a series of programs. Each program will be no longer than 255 characters and may
    be split over several lines for convenience. There will be no more than 10 programs. The file will be
    terminated by a line containing only a single ‘#’.

    Output
    Output will consist of one line for each line of input. Each line will consist of the final score of the
    relevant program right justified in a field of width 3.
    Universidad de Valladolid OJ: 174 – Strategy 2/2

    Sample Input
    CHEAT.
    IF MY LAST1 = CHEAT THEN TRADE ELSE CHEAT.
    IFYOURLAST2=NULLTHENTRADEELSEIFYOURLAST1=TRADETHENTRADE
    ELSECHEAT.
    #

    Sample Output
    1
    -12
    -13

    You might also like