• creating functions
• manipulating arrays
• using a while loop for repetition

Before the lab you should re-read the relevant lecture slides and their accompanying examples. You should also have read the lab assessment guidelines.

Create a new directory for this lab called lab05 by typing:

mkdir lab05

Change to this directory by typing:

cd lab05

Complete the function count_farnarkles in farnarkle.c

// return number of farnarkles
int count_farnarkles(int tiles1[N_TILES], int tiles2[N_TILES]) {
    int n_farnarkles = 0;

    int i = 0;
    while (i < N_TILES) {
        if (tiles1[i] == tiles2[i]) {
            n_farnarkles = n_farnarkles + 1;
        }
        i = i + 1;
    }

    return n_farnarkles;
}

count_farnarkles should given two tile sequences, return the number of farnarkles.

Note: it doesn't matter which sequence is the hidden sequence and which is the guess.

farnarkle.c contains a main function which will let you test count_farnarkles

For example:

dcc farnarkle.c -o farnarkle
./farnarkle
Enter 0 to call count_farnarkles()
Enter 1 to call count_arkles()
Enter 2 to call play_farnarkle()
Enter 3 to call test_ai_farnarkle_player()
Call which function: 0
Enter tile sequence 1: 1 2 3 4
Enter tile sequence 2: 2 1 3 8
count_farnarkles returned 1 for
Sequence 1: 1 2 3 4
Sequence 2: 2 1 3 8
./farnarkle
Enter 0 to call count_farnarkles()
Enter 1 to call count_arkles()
Enter 2 to call play_farnarkle()
Enter 3 to call test_ai_farnarkle_player()
Call which function: 0
Enter tile sequence 1: 5 5 6 5
Enter tile sequence 2: 6 5 5 5
count_farnarkles returned 2 for
Sequence 1: 5 5 6 5
Sequence 2: 6 5 5 5

When you think your program is working you can use autotest to run some simple automated tests:

1511 autotest count_farnarkles

When you are finished on this exercise you and your lab partner must both submit your work by running give:

give cs1511 wk05_count_farnarkles farnarkle.c

Note, even though this is a pair exercise, you both must run give from your own account before Sunday 8 April 23:59:59 to obtain the marks for this lab exercise.

Complete the function count_arkles in farnarkle.c.

INTERNAL ERROR MISSING FILE: "activities/count_arkles/farnarkle.c"

count_arkles should given two tile sequences, return the number of arkles.

Note: it doesn't matter which sequence is the hidden sequence and which is the guess.

farnarkle.c contains a main function which will let you test count_arkles

For example:

dcc farnarkle.c -o farnarkle
./farnarkle
Enter 0 to call count_farnarkles()
Enter 1 to call count_arkles()
Enter 2 to call play_farnarkle()
Enter 3 to call test_ai_farnarkle_player()
Call which function: 1
Enter tile sequence 1: 1 2 3 4
Enter tile sequence 2: 2 1 3 2
count_arkles returned 2 for
Sequence 1: 1 2 3 4
Sequence 2: 2 1 3 2
./farnarkle
Enter 0 to call count_farnarkles()
Enter 1 to call count_arkles()
Enter 2 to call play_farnarkle()
Enter 3 to call test_ai_farnarkle_player()
Call which function: 1
Enter tile sequence 1: 5 8 5 5
Enter tile sequence 2: 8 5 8 8
count_arkles returned 2 for
Sequence 1: 5 8 5 5
Sequence 2: 8 5 8 8

When you think your program is working you can use autotest to run some simple automated tests:

1511 autotest count_arkles

When you are finished on this exercise you and your lab partner must both submit your work by running give:

give cs1511 wk05_count_arkles farnarkle.c

Note, even though this is a pair exercise, you both must run give from your own account before Sunday 8 April 23:59:59 to obtain the marks for this lab exercise.

Complete the function play_farnarkle in farnarkle.c

INTERNAL ERROR MISSING FILE: "activities/play_farnarkle/farnarkle.c"

play_farnarkle should given a hidden tile sequences, reads guesses from a human player, printing the number of farnarkles and arkles for each guess, until the human player guesses the sequence.

Use read_tiles to read the guesses.

farnarkle.c contains a main function which will let you test play_farnarkle

For example:

./farnarkle
Enter 0 to call count_farnarkles()
Enter 1 to call count_arkles()
Enter 2 to call play_farnarkle()
Enter 3 to call test_ai_farnarkle_player()
Call which function: 2
Enter guess for turn 1: 1 5 7 8
0 farnarkles, 1 arkles
Enter guess for turn 2: 2 3 4 6
3 farnarkles, 0 arkles
Enter guess for turn 3: 2 3 4 7
2 farnarkles, 0 arkles
Enter guess for turn 4: 2 3 8 6
3 farnarkles, 0 arkles
Enter guess for turn 5: 2 3 1 6
4 farnarkles, 0 arkles
You win

When you think your program is working you can use autotest to run some simple automated tests:

1511 autotest play_farnarkle

When you are finished on this exercise you and your lab partner must both submit your work by running give:

give cs1511 wk05_play_farnarkle farnarkle.c

Note, even though this is a pair exercise, you both must run give from your own account before Sunday 8 April 23:59:59 to obtain the marks for this lab exercise.

Complete the function farnarkle_ai in farnarkle.c which plays Farnarkle. farnarkle_ai only makes a single guess. It is called each time a guess needs to be made - and it is given information about all previous guesses.

Do not use global or static variables to store information between calls tofarnarkle_ai .

farnarkle.c contains a main function which will let you test farnarkle_ai

For example:

dcc farnarkle.c -o farnarkle 
./farnarkle
Enter 0 to call count_farnarkles()
Enter 1 to call count_arkles()
Enter 2 to call play_farnarkle()
Enter 3 to call test_ai_farnarkle_player()
Call which function: 3
Enter hidden tiles: 4 5 3 5
Turn 1: farnarkle AI guess is: 1 1 1 1 = 0 farnarkles, 0 arkles
Turn 2: farnarkle AI guess is: 2 2 2 2 = 0 farnarkles, 0 arkles
Turn 3: farnarkle AI guess is: 3 3 3 3 = 1 farnarkles, 0 arkles
Turn 4: farnarkle AI guess is: 4 4 4 3 = 1 farnarkles, 1 arkles
Turn 5: farnarkle AI guess is: 5 4 3 5 = 2 farnarkles, 2 arkles
Turn 6: farnarkle AI guess is: 4 5 3 5 = 4 farnarkles, 0 arkles
Farnarkle AI took 6 turns to guess the tiles.

A farnarkle player tournament will be announced on the class web page at the end of the week.

N_TILES and MAX_TILE will vary between tournament rounds. N_TILES will always be in the range 2..8 (inclusive) and MAX_TILE will always be in the range 4..16 (inclusive)

The challenge mark will be based on how well your player performs in this tournament.

Can you make your farnarkle player optimal - make it take, on average, the smallest number of turns possible to guess a code?

Can you prove that your farnarkle player is optimal?

If you can not construct a proof and/or an optimal player, construct a logical argument as to why your player is close to optimal.

The autotest for farnarkle_ai give yours function previous guesses, with farnarkle and arkle counts such that only there is only possible guess consistent with them.

When you think your program is working you can use autotest to run some simple automated tests:

1511 autotest farnarkle_ai

When you are finished working on this exercise you must submit your work by running give:

give cs1511 wk05_farnarkle_ai farnarkle.c

You must run give before Sunday 8 April 23:59:59 to obtain the marks for this lab exercise. Note, this is an individual exercise, the work you submit with give must be entirely your own.

When you are finished each exercises make sure you submit your work by running give.

You can run give multiple times. Only your last submission will be marked.

Don't submit any exercises you haven't attempted.

If you are working at home, you may find it more convenient to upload your work via give's web interface.

Remember you have until Sunday 8 April 23:59:59 to submit your work.

Automarking will be run several days after the submission deadline for the test. When complete you can view automarking here and you can view the the resulting mark via give's web interface

You can read more about lab assessment here