{"id":13293,"date":"2026-01-19T03:00:00","date_gmt":"2026-01-19T08:00:00","guid":{"rendered":"https:\/\/www.both.org\/?p=13293"},"modified":"2026-01-07T16:32:15","modified_gmt":"2026-01-07T21:32:15","slug":"writing-a-fun-turn-based-game","status":"publish","type":"post","link":"http:\/\/www.both.org\/?p=13293","title":{"rendered":"Writing a fun turn-based game"},"content":{"rendered":"
\r\n
\r\n \r\n <\/i>\r\n <\/a>\r\n <\/span>\r\n<\/div><\/div>\n

When I need a distraction, I make a little program to amuse myself. Today, I wrote a simple “code-breaker” game.<\/p>\n\n\n\n

This game is similar to the Bulls and Cows<\/a> game, or the Mastermind board game. An early version of Unix included a version of Bulls and Cows, where you try to guess a series of four random digits, nonrepeating. After each guess, the computer tells you how many digits are correct, or correct but in the wrong position. For example, if the secret code was 4930 and you guessed 1234, the computer would respond with “1 bull and 1 cow: the bull is 3 and the cow is 4” because the 3 is correct and in the right place<\/em> and the 4 appears in the secret code but not at that position<\/em>.<\/p>\n\n\n\n

I wanted to play a similar game, but I made the hints easier to follow. The user has just five attempts to guess a secret code of five nonrepeating digits. For each guess, the program prints my code, and for each digit indicates !<\/code> if that digit is correct and in the right place<\/em>, ?<\/code> if the digit appears in the secret but not at that position<\/em>, and x<\/code> if the number doesn’t appear in the secret at all. It turns out that five guesses is challenging but not unreasonable.<\/p>\n\n\n\n

Here’s how you can write your own version of this “code-breaker” game.<\/p>\n\n\n\n

Making a secret code<\/h2>\n\n\n\n

The core part of the game involves reading input from the user and comparing it to a secret value. To generate a random string of nonrepeating digits, I first started with the numbers 0 to 9, and “shuffled” them to make a random order.<\/p>\n\n\n\n

One way to get random numbers is with the getrandom<\/strong> system call, which queries the Linux kernel to fill random bits into a variable. This is a much better method than the C standard library function rand<\/strong>, which only generates pseudorandom<\/em> values. Here’s a test program to shuffle a string of digits into a random order:<\/p>\n\n\n\n

#include <stdio.h>\n#include <sys\/random.h>\n\nvoid shuffle(char *list, int len)\n{\n    char c;\n    unsigned int n;\n\n    for (int i = 0; i < len; i++) {\n        getrandom(&n, sizeof(unsigned int), GRND_NONBLOCK);\n        n %= len;\n\n        c = list[n];\n        list[n] = list[i];\n        list[i] = c;\n    }\n}\n\nint main()\n{\n    char secret[] = \"1234567890\";\n\n    puts(secret);\n    shuffle(secret, 10);\n    puts(secret);\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
In the shuffle<\/strong> function, I’ve stored the random bits in an unsigned variable so that the random bits will always be positive. Then I use that value in a modulo<\/em> (%<\/code>) operation to get a number between 0 and len-1<\/code>.<\/p>\n\n\n\n
Save this test program as shuffle.c<\/code> and compile it:<\/p>\n\n\n\n
$ gcc -o shuffle shuffle.c<\/code><\/pre>\n\n\n\n
When I run the program, I can see it print out the original list of digits, then the shuffled list of digits:<\/p>\n\n\n\n
1234567890\n5413702869<\/code><\/pre>\n\n\n\n
With this method, I effectively have created a random order of digits. If I use only the first five digits, I have a secret code of five nonrepeating numbers, which I can use in my game.<\/p>\n\n\n\n
Read guesses<\/h2>\n\n\n\n
Reading input from the user is a tricky business. If my program prompts the user to enter some text, my program needs to have enough memory to store the full line. This is where a lot of programmers might create the conditions for a buffer “overflow,” where the user enters more data than the program can save into a variable.<\/p>\n\n\n\n
For example, my “code-breaker” game only uses five digits, you might assume that I only need to make room for five characters of input. But what if the user enters “123456” as their guess? That’s longer than the five characters that are reserved for input.<\/p>\n\n\n\n
Instead, I can use the getline<\/strong> function to read input. This is a flexible method to read data from the user, because it automatically reserves more memory to store all of the text. To use getline<\/strong>, start by defining a pointer<\/em> to a string variable, and another variable that stores the size. You can allocate some memory to start with, but if you set the pointer to NULL<\/code> and the size to zero then getline<\/strong> will do the rest to automatically allocate memory as it goes.<\/p>\n\n\n\n
Let’s demonstrate with a sample program that just reads a string from the user and prints it back to the screen. Note that getline<\/strong> returns the number of characters that it read, or -1 if it reached the end of the input (such as the end of a file).<\/p>\n\n\n\n
#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    char *s = NULL;\n    size_t len = 0;\n\n    if (getline(&s, &len, stdin) == -1) {\n        puts(\"(end)\");\n    }\n    else {\n        fputs(s, stdout);\n    }\n\n    free(s);\n    return 0;\n}<\/code><\/pre>\n\n\n\n
This program uses the variable s<\/strong> for the string, which has its size stored in len<\/strong>. Note that s<\/strong> starts with a NULL<\/code> value, and len<\/strong> with zero. That means getline<\/strong> will allocate some default amount of memory to start. You should release the memory with the free<\/strong> function before you end the program, which I’ve done here.<\/p>\n\n\n\n
If I save my sample program as input.c<\/code> and compile it, then run it, I can type in some sample text and the program will print it back to me.<\/p>\n\n\n\n
Hello world\nHello world<\/code><\/pre>\n\n\n\n
Comparing a guess<\/h2>\n\n\n\n
One other component we need for the “code-breaking” game is a method to compare the user’s guess with the secret value. To do this, I like to first print the user’s guess on a line by itself, then print another line to provide the hints.<\/p>\n\n\n\n
To show the user’s guess, I could just print the full string. But the game only uses a five digit code; if the user entered a longer string, I don’t want to compare the extra characters in their guess. Similarly, if the user’s guess was too short, I don’t need to compare the secret values with text was wasn’t entered. That means when I display the guess, I only want to limit it to the first five characters, and keep track of how long the user’s guess was.<\/p>\n\n\n\n
int compare(char *guess, char *secret, int ncompar)\n{\n    int len = ncompar;\n    int correct = 0;\n\n    \/* show guess *\/\n\n    putchar('\\t');\n    for (int i = 0; i < ncompar; i++) {\n        if ((len == ncompar) && (strnchr(\"\\0\\n\", 2, guess[i]) >= 0)) {\n            len = i;\n        }\n\n        if (i < len) {\n            putchar(guess[i]);\n        }\n        else {\n            putchar(' ');              \/* too short, pad with ' ' *\/\n        }\n    }\n    putchar('\\n');<\/code><\/pre>\n\n\n\n
The function starts by assigning the len<\/code> variable to the same value as the ncompar<\/code> parameter, which is the number of characters to compare from the user’s guess and the secret code. The important stuff is in the for<\/code> loop. When the program encounters a null character (\\0<\/code>) or a new line character (\\n<\/code>) it resets the len<\/code> variable to the current position in the string. When the loop is finished, the len<\/code> variable will be the length of the user’s input, or the length of the secret code, whichever is greater. That means I can use len<\/code> in another loop to compare just the digits from the user’s guess:<\/p>\n\n\n\n
    \/* show hints *\/\n\n    putchar('\\t');\n    for (int i = 0; i < len; i++) {\n        if (guess[i] == secret[i]) {\n            putchar('!');              \/* correct *\/\n            correct++;\n        }\n        else if (strnchr(secret, len, guess[i]) >= 0) {\n            putchar('?');              \/* correct, but not correct position *\/\n        }\n        else {\n            putchar('x');              \/* not there *\/\n        }\n    }\n    putchar('\\n');\n\n    return correct;\n}<\/code><\/pre>\n\n\n\n
For each digit, the function prints !<\/code> if that digit is correct and in the right place<\/em>, ?<\/code> if the digit appears in the secret but not at that position<\/em>, and x<\/code> if the number doesn’t appear in the secret at all.<\/p>\n\n\n\n
To make this function easier to write, I also created a separate “helper” function called strnchr<\/strong> that indicates if a character exists in a longer string. This is similar to the C standard library function strchr<\/strong> but it only looks at the first n<\/code> characters. Also, my strnchr<\/strong> function returns an integer value, where strchr<\/strong> returns a pointer into the string. The function also returns -1 if the character cannot be found in the string.<\/p>\n\n\n\n
int strnchr(char *s, int len, char c)\n{\n    int pos;\n\n    for (pos = 0; pos < len; pos++) {\n        if (c == s[pos]) {\n            return pos;\n        }\n    }\n\n    return -1;\n}<\/code><\/pre>\n\n\n\n
Putting it all together<\/h2>\n\n\n\n
With these components, I can now write a full version of the game. After generating a secret code, my program reads guesses from the user, then compares each guess to the secret code. For each guess, the program provides hints for correct and incorrect digits from the secret code. If the user can guess the secret code within five guesses, the program prints a “That’s right” message. Otherwise, the program prints different messages depending on how close the user was to the secret value.<\/p>\n\n\n\n
Here’s the complete program, with extra comments:<\/p>\n\n\n\n
#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/random.h>\n\nvoid shuffle(char *list, int len)\n{\n    char c;\n    unsigned int n;\n\n    \/* shuffle the items in the list. this isn't a very secure shuffle,\n     * but it's only for a simple game so it's okay. *\/\n\n    for (int i = 0; i < len; i++) {\n        getrandom(&n, sizeof(unsigned int), GRND_NONBLOCK);\n        n %= len;\n\n        c = list[n];\n        list[n] = list[i];\n        list[i] = c;\n    }\n}\n\nint strnchr(char *s, int len, char c)\n{\n    int pos;\n\n    \/* find the first occurrence of c in s, for first len chars,\n     * and return the position in the string. *\/\n    for (pos = 0; pos < len; pos++) {\n        if (c == s[pos]) {\n            return pos;\n        }\n    }\n\n    \/* not found, return error *\/\n    return -1;\n}\n\nint compare(char *guess, char *secret, int ncompar)\n{\n    int len = ncompar;\n    int correct = 0;\n\n    \/* show guess *\/\n\n    putchar('\\t');\n    for (int i = 0; i < ncompar; i++) {\n        if ((len == ncompar) && (strnchr(\"\\0\\n\", 2, guess[i]) >= 0)) {\n            len = i;\n        }\n\n        if (i < len) {\n            putchar(guess[i]);\n        }\n        else {\n            putchar(' ');              \/* too short, pad with ' ' *\/\n        }\n    }\n    putchar('\\n');\n\n    \/* show hints *\/\n\n    putchar('\\t');\n    for (int i = 0; i < len; i++) {\n        if (guess[i] == secret[i]) {\n            putchar('!');              \/* correct *\/\n            correct++;\n        }\n        else if (strnchr(secret, len, guess[i]) >= 0) {\n            putchar('?');              \/* correct, but not correct position *\/\n        }\n        else {\n            putchar('x');              \/* not there *\/\n        }\n    }\n    putchar('\\n');\n\n    return correct;\n}\n\nint main()\n{\n    char secret[] = \"1234567890\";\n    char *guess;\n    size_t size;\n    int turns = 5, found;\n\n    \/* print instructions *\/\n\n    puts(\"You have five turns to guess a 5-digit number, non-repeating.\");\n    puts(\"After each guess, I'll tell you what you got right and wrong,\");\n    puts(\"so you can make your next guess.\");\n\n    \/* let the user guess the secret number *\/\n\n    shuffle(secret, 10);\n\n    do {\n        printf(\"%d:\", turns);          \/* prompt *\/\n\n        if (getline(&guess, &size, stdin) == -1) {\n            turns = 0;\n        }\n        else {\n            found = compare(guess, secret, 5);\n        }\n    } while ((--turns > 0) && (found < 5));\n\n    \/* give feedback *\/\n\n    if (found == 5) {\n        puts(\"That's right!\");\n    }\n    else if (found >= 3) {\n        puts(\"You almost had it\");\n    }\n    else if (found >= 1) {\n        puts(\"You were getting there\");\n    }\n    else {\n        puts(\"Way off\");\n    }\n\n    free(guess);\n    return 0;\n}<\/code><\/pre>\n\n\n\n
Save this as codebrk.c<\/code> and compile it. The game is quite fun to play. It turns out that five guesses is challenging but reasonable. I usually start my guess with 12345<\/code>:<\/p>\n\n\n\n
$ .\/codebrk \nYou have five turns to guess a 5-digit number, non-repeating.\nAfter each guess, I'll tell you what you got right and wrong,\nso you can make your next guess.\n5:12345     \n    12345\n    xxx??<\/code><\/pre>\n\n\n\n
After my first guess, I know that the secret has the digits 4 and 5, but not in the last two positions. The numbers 1, 2, and 3 do not appear at all in the secret code. So I might update my guess to put 4 and 5 at the start, and guess a few other digits:<\/p>\n\n\n\n
4:45678\n    45678\n    ???!x<\/code><\/pre>\n\n\n\n
With this guess, I know that 7 is in the correct position. and that 4, 5, and 6 appear in the secret but not in those positions. The number 8 isn’t in the secret code at all. This is enough information to make a new guess:<\/p>\n\n\n\n
3:64579\n    64579\n    ???!x<\/code><\/pre>\n\n\n\n
It doesn’t feel like I’m getting closer, but I am. I know that 9 doesn’t appear in the secret, and the 4, 5, and 6 are still in the wrong positions. I can make another guess:<\/p>\n\n\n\n
2:06475\n    06475\n    ?!!!?<\/code><\/pre>\n\n\n\n
And now I have the information I need to solve the puzzle. I know that 6, 4, and 7 are in the right positions, but 0 and 5 are not. There’s only one possible code that matches this criteria:<\/p>\n\n\n\n
1:56470\n    56470\n    !!!!!\nThat's right!<\/code><\/pre>\n\n\n\n
Writing a simple game like this is a fun way to explore programming. Feel free to modify the program to make it your own, such as giving the user more guesses, or making a longer secret code.<\/p>\n","protected":false},"excerpt":{"rendered":"
With a bit of programming, you’ll never get bored.<\/p>\n","protected":false},"author":33,"featured_media":2949,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_lmt_disableupdate":"","_lmt_disable":"","footnotes":""},"categories":[5,150],"tags":[147,152],"class_list":["post-13293","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-linux","category-programming","tag-fun","tag-programming"],"modified_by":"David Both","_links":{"self":[{"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts\/13293","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/users\/33"}],"replies":[{"embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=13293"}],"version-history":[{"count":3,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts\/13293\/revisions"}],"predecessor-version":[{"id":13296,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts\/13293\/revisions\/13296"}],"wp:featuredmedia":[{"embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/media\/2949"}],"wp:attachment":[{"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=13293"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=13293"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=13293"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}