2023-11-12 19:34:40 +09:00
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdbool.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2023-11-12 19:57:13 +09:00
|
|
|
#include <curses.h>
|
2023-11-12 20:43:33 +09:00
|
|
|
#include <signal.h>
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
struct ut_state
|
2023-11-12 19:34:40 +09:00
|
|
|
{
|
2023-11-12 19:57:13 +09:00
|
|
|
char tiles[9][9];
|
|
|
|
char boards[3][3];
|
|
|
|
int playBoard;
|
|
|
|
char player;
|
2023-11-12 19:34:40 +09:00
|
|
|
};
|
2023-11-12 20:43:33 +09:00
|
|
|
const struct ut_state ut_initial = {
|
|
|
|
.boards = {0},
|
|
|
|
.tiles = {0},
|
|
|
|
.playBoard = -1,
|
|
|
|
.player = 'X'
|
|
|
|
};
|
2023-11-12 19:34:40 +09:00
|
|
|
|
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
char ut_turn(char player)
|
2023-11-12 19:34:40 +09:00
|
|
|
{
|
2023-11-12 19:57:13 +09:00
|
|
|
switch(player)
|
|
|
|
{
|
|
|
|
case 'X': return 'O';
|
|
|
|
case 'O': return 'X';
|
|
|
|
default: return '\0';
|
|
|
|
}
|
2023-11-12 19:34:40 +09:00
|
|
|
}
|
|
|
|
|
|
|
|
#define T(r, c) (tiles[offset + stride * r + c])
|
2023-11-13 00:53:57 +09:00
|
|
|
char ut_winner(const char *tiles, int offset, int stride) {
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
// whoreizontal wins
|
|
|
|
for (int y = 0; y < 3; y++)
|
|
|
|
{
|
|
|
|
char tile = T(y, 0);
|
|
|
|
if (tile == '\0') {continue;}
|
|
|
|
if (tile == T(y, 1) && tile == T(y, 2)) {return tile;}
|
|
|
|
}
|
|
|
|
|
|
|
|
// vertical wins
|
|
|
|
for (int x = 0; x < 3; x++)
|
|
|
|
{
|
|
|
|
char tile = T(0, x);
|
|
|
|
if (tile == '\0') {continue;}
|
|
|
|
if (tile == T(1, x) && tile == T(2, x)) {return tile;}
|
|
|
|
}
|
|
|
|
|
|
|
|
// diagonalz
|
|
|
|
char tile = T(1, 1);
|
2023-11-12 20:43:33 +09:00
|
|
|
if (tile != '\0')
|
|
|
|
{
|
|
|
|
if (tile == T(0, 0) && tile == T(2, 2)) {return tile;}
|
|
|
|
if (tile == T(2, 0) && tile == T(0, 2)) {return tile;}
|
2023-11-12 20:39:43 +09:00
|
|
|
}
|
|
|
|
|
2023-11-12 20:43:33 +09:00
|
|
|
for(int y = 0; y < 3; y++)
|
|
|
|
{
|
|
|
|
for(int x = 0; x < 3; x++)
|
|
|
|
{
|
|
|
|
if(T(y, x) == '\0') {return '\0';} // in progress
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ' '; // draw
|
2023-11-12 19:34:40 +09:00
|
|
|
}
|
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
int ut_move(struct ut_state *new_state, const struct ut_state *old_state, int row, int col)
|
2023-11-12 19:34:40 +09:00
|
|
|
{
|
2023-11-12 19:57:13 +09:00
|
|
|
// bad move - out of bounds
|
|
|
|
if(row < 0 || row >= 9 || col < 0 || col >= 9) {return 1;}
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
// state->playBoard == -1 means all boards playable; otherwise only one board is playable
|
|
|
|
if (old_state->playBoard != -1 && old_state->playBoard != 3 * (row / 3) + (col / 3)) {return 1;}
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
// bad move - tile is occupied
|
|
|
|
if(old_state->tiles[row][col] != '\0') {return 1;} // replace with ' ' maybe
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
// copy old_state->{tiles,boards} to new_state->{tiles,boards}
|
|
|
|
memmove(new_state->tiles, old_state->tiles, sizeof(old_state->tiles));
|
|
|
|
memmove(new_state->boards, old_state->boards, sizeof(old_state->boards));
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
// do move
|
|
|
|
new_state->tiles[row][col] = old_state->player;
|
2023-11-12 20:58:58 +09:00
|
|
|
new_state->boards[row / 3][col / 3] = ut_winner((char *)new_state->tiles, 27 * (row / 3) + 3 * (col / 3), 9);
|
2023-11-12 19:57:13 +09:00
|
|
|
|
|
|
|
// next play board - if next play board is not playable, play any board
|
|
|
|
new_state->playBoard = new_state->boards[row % 3][col % 3] == '\0' ? 3 * (row % 3) + (col % 3) : -1;
|
2023-11-12 19:34:40 +09:00
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
new_state->player = ut_turn(old_state->player);
|
|
|
|
return 0;
|
2023-11-12 19:34:40 +09:00
|
|
|
}
|
|
|
|
|
2023-11-13 00:53:57 +09:00
|
|
|
void ut_drawBoard(const char *tiles, int offset, int stride, int iy, int ix, char winner, bool highlight)
|
|
|
|
{
|
|
|
|
// 5x5 board display
|
|
|
|
/*
|
|
|
|
* X|X|X
|
|
|
|
* -+-+-
|
|
|
|
* X|X|X
|
|
|
|
* -+-+-
|
|
|
|
* X|X|X
|
|
|
|
*/
|
|
|
|
for(int r = 0; r < 3; r++)
|
|
|
|
for(int c = 0; c < 3; c++)
|
|
|
|
mvaddch(iy + 2 * r, ix + 2 * c, T(r, c) != '\0' ? T(r, c) : ' ');
|
|
|
|
//char info = winner != '\0' ? winner : highlight ? '*' : ' ';
|
|
|
|
for(int r = 0; r < 3; r++)
|
|
|
|
for(int c = 0; c < 2; c++)
|
|
|
|
mvaddch(iy + 2 * r, ix + 2 * c + 1, winner != '\0' ? winner : '|');
|
|
|
|
for(int r = 0; r < 2; r++)
|
|
|
|
for(int c = 0; c < 3; c++)
|
|
|
|
mvaddch(iy + 2 * r + 1, ix + 2 * c, winner != '\0' ? winner : '-');
|
|
|
|
for(int r = 0; r < 2; r++)
|
|
|
|
for(int c = 0; c < 2; c++)
|
|
|
|
mvaddch(iy + 2 * r + 1, ix + 2 * c + 1, winner != '\0' ? winner : highlight ? '*' : '+');
|
|
|
|
}
|
|
|
|
|
|
|
|
void ut_draw(const struct ut_state *state)
|
|
|
|
{
|
|
|
|
for(int r = 0; r < 3; r++)
|
|
|
|
for(int c = 0; c < 3; c++)
|
|
|
|
ut_drawBoard((char *)state->tiles,
|
|
|
|
27 * r + 3 * c, 9,
|
|
|
|
7 * r + 1, 7 * c + 1,
|
|
|
|
state->boards[r][c],
|
|
|
|
state->playBoard == -1 || state->playBoard == 3 * r + c);
|
2023-11-13 11:52:21 +09:00
|
|
|
//refresh();
|
2023-11-13 00:53:57 +09:00
|
|
|
}
|
|
|
|
|
2023-11-13 11:52:21 +09:00
|
|
|
int ut_click(const struct ut_state *state, int *r, int *c)
|
2023-11-13 00:53:57 +09:00
|
|
|
{
|
2023-11-13 11:52:21 +09:00
|
|
|
#define P(r, c, d) ((state->playBoard == -1 || state->playBoard == 3 * (r / 3) + (c / 3)) && \
|
|
|
|
(state->boards[r / 3][c / 3] == '\0' || d % 3 == 1))
|
2023-11-13 00:53:57 +09:00
|
|
|
MEVENT event;
|
2023-11-13 11:52:21 +09:00
|
|
|
mvaddstr(21, 0, "Select move with arrow keys or mouse.");
|
|
|
|
if(state->playBoard == -1)
|
|
|
|
{
|
|
|
|
*r = 3 * (*r / 3) + 1;
|
|
|
|
*c = 3 * (*c / 3) + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
*r = 3 * (state->playBoard / 3) + 1;
|
|
|
|
*c = 3 * (state->playBoard % 3) + 1;
|
|
|
|
}
|
2023-11-13 00:53:57 +09:00
|
|
|
for(;;)
|
|
|
|
{
|
2023-11-13 11:52:21 +09:00
|
|
|
/*if(state->boards[*r / 3][*c / 3] != '\0')
|
|
|
|
{
|
|
|
|
*r = 3 * (*r / 3) + 1;
|
|
|
|
*c = 3 * (*c / 3) + 1;
|
|
|
|
}*/
|
2023-11-13 00:53:57 +09:00
|
|
|
move((7 * (*r / 3) + 1) + (2 * (*r % 3)),
|
|
|
|
(7 * (*c / 3) + 1) + (2 * (*c % 3)));
|
|
|
|
refresh();
|
|
|
|
switch(getch())
|
|
|
|
{
|
|
|
|
case KEY_MOUSE:
|
|
|
|
if(getmouse(&event) == OK && (event.bstate & BUTTON1_CLICKED))
|
|
|
|
{
|
|
|
|
if(event.y < 0 || event.y >= 21) {break;}
|
|
|
|
if(event.x < 0 || event.x >= 21) {break;}
|
|
|
|
*r = event.y % 7 - 1; // this messes up cursor position
|
|
|
|
*c = event.x % 7 - 1;
|
|
|
|
if(*r % 2 != 0) {break;}
|
|
|
|
if(*c % 2 != 0) {break;}
|
|
|
|
*r /= 2; *c /= 2;
|
|
|
|
*r += 3 * (event.y / 7);
|
|
|
|
*c += 3 * (event.x / 7);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
break;
|
2023-11-13 11:52:21 +09:00
|
|
|
case 'k': /* FALLTHROUGH */
|
2023-11-13 00:53:57 +09:00
|
|
|
case 'w': /* FALLTHROUGH */
|
|
|
|
case KEY_UP:
|
2023-11-13 11:52:21 +09:00
|
|
|
//*r = (((*r - 1) % 9) + 9) % 9;
|
|
|
|
for(int i = 0; i < 9 + 1; i++)
|
|
|
|
{
|
|
|
|
*r = (*r + 9 - 1) % 9;
|
|
|
|
if(P(*r, *c, *r)) {break;}
|
|
|
|
}
|
2023-11-13 00:53:57 +09:00
|
|
|
break;
|
2023-11-13 11:52:21 +09:00
|
|
|
case 'h': /* FALLTHROUGH */
|
2023-11-13 00:53:57 +09:00
|
|
|
case 'a': /* FALLTHROUGH */
|
|
|
|
case KEY_LEFT:
|
2023-11-13 11:52:21 +09:00
|
|
|
//*c = (((*c - 1) % 9) + 9) % 9;
|
|
|
|
for(int i = 0; i < 9 + 1; i++)
|
|
|
|
{
|
|
|
|
*c = (*c + 9 - 1) % 9;
|
|
|
|
if(P(*r, *c, *c)) {break;}
|
|
|
|
}
|
2023-11-13 00:53:57 +09:00
|
|
|
break;
|
2023-11-13 11:52:21 +09:00
|
|
|
case 'j': /* FALLTHROUGH */
|
2023-11-13 00:53:57 +09:00
|
|
|
case 's': /* FALLTHROUGH */
|
|
|
|
case KEY_DOWN:
|
2023-11-13 11:52:21 +09:00
|
|
|
//*r = (*r + 1) % 9;
|
|
|
|
for(int i = 0; i < 9 + 1; i++)
|
|
|
|
{
|
|
|
|
*r = (*r + 1) % 9;
|
|
|
|
if(P(*r, *c, *r)) {break;}
|
|
|
|
}
|
2023-11-13 00:53:57 +09:00
|
|
|
break;
|
2023-11-13 11:52:21 +09:00
|
|
|
case 'l': /* FALLTHROUGH */
|
2023-11-13 00:53:57 +09:00
|
|
|
case 'd': /* FALLTHROUGH */
|
|
|
|
case KEY_RIGHT:
|
2023-11-13 11:52:21 +09:00
|
|
|
//*c = (*c + 1) % 9;
|
|
|
|
for(int i = 0; i < 9 + 1; i++)
|
|
|
|
{
|
|
|
|
*c = (*c + 1) % 9;
|
|
|
|
if(P(*r, *c, *c)) {break;}
|
|
|
|
}
|
2023-11-13 00:53:57 +09:00
|
|
|
break;
|
|
|
|
case ' ': /* FALLTHROUGH */
|
2023-11-13 11:52:21 +09:00
|
|
|
case '\r': /* FALLTHROUGH */
|
2023-11-13 00:53:57 +09:00
|
|
|
case KEY_ENTER:
|
|
|
|
return 0;
|
|
|
|
case ERR: /* FALLTHROUGH */
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2023-11-13 11:52:21 +09:00
|
|
|
#undef P
|
2023-11-13 00:53:57 +09:00
|
|
|
}
|
|
|
|
|
2023-11-12 20:00:19 +09:00
|
|
|
void ut_show(const struct ut_state *state) {
|
2023-11-12 19:34:40 +09:00
|
|
|
#define tiles state->tiles
|
|
|
|
printf("Turn: %c\nPlay board: %d\n", (int)state->player, state->playBoard);
|
|
|
|
int play_board_row = -1;
|
|
|
|
int play_board_col = -1;
|
|
|
|
if (state->playBoard != -1) {
|
|
|
|
play_board_row = state->playBoard / 3;
|
|
|
|
play_board_col = state->playBoard % 3;
|
|
|
|
}
|
|
|
|
printf(" 012 345 678\n");
|
|
|
|
for(int y = 0; y < 9; y++)
|
|
|
|
{
|
|
|
|
if (y == 3 || y == 6) {
|
|
|
|
printf(" ---+---+---\n");
|
|
|
|
}
|
|
|
|
printf("%d ", y);
|
|
|
|
for(int x = 0; x < 9; x++)
|
|
|
|
{
|
|
|
|
if (x == 3 || x == 6) {
|
|
|
|
putchar('|');
|
|
|
|
}
|
|
|
|
putchar(tiles[y][x] ? tiles[y][x] : ' ');
|
|
|
|
}
|
|
|
|
if (y / 3 == play_board_row) {
|
|
|
|
printf("<");
|
|
|
|
}
|
|
|
|
putchar('\n');
|
|
|
|
}
|
|
|
|
if (play_board_col != -1) {
|
|
|
|
printf(" ");
|
|
|
|
for (int i = 0; i < play_board_col; i++) {
|
|
|
|
printf(" ");
|
|
|
|
}
|
|
|
|
printf("^^^");
|
|
|
|
putchar('\n');
|
|
|
|
}
|
|
|
|
putchar('\n');
|
|
|
|
#undef tiles
|
|
|
|
}
|
|
|
|
|
2023-11-12 19:57:13 +09:00
|
|
|
bool getpos(const struct ut_state *state, int *x, int *y) {
|
|
|
|
while (true) {
|
|
|
|
printf("Place token %c at position x,y: ", state->player);
|
|
|
|
char line[5] = {0};
|
|
|
|
if (fgets(line, 5, stdin) == NULL)
|
|
|
|
return false;
|
|
|
|
// line was too short
|
|
|
|
if (line[3] == '\0')
|
|
|
|
continue;
|
|
|
|
// line was too long
|
|
|
|
if (line[3] != '\n') {
|
|
|
|
// consume rest of line
|
|
|
|
while (true) {
|
|
|
|
int garbage = getchar();
|
|
|
|
if (garbage == EOF)
|
|
|
|
return false;
|
|
|
|
if (garbage == '\n')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
int sscanf_result = sscanf(line, "%d,%d", x, y);
|
|
|
|
if (sscanf_result == EOF)
|
|
|
|
return false;
|
|
|
|
if (sscanf_result != 2)
|
|
|
|
continue;
|
2023-11-12 20:24:27 +09:00
|
|
|
break;
|
2023-11-12 19:57:13 +09:00
|
|
|
}
|
|
|
|
return true;
|
2023-11-12 19:34:40 +09:00
|
|
|
}
|
|
|
|
|
2023-11-12 20:43:33 +09:00
|
|
|
void finish(int sig)
|
|
|
|
{
|
|
|
|
endwin();
|
|
|
|
// other cleanup
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
2023-11-12 19:34:40 +09:00
|
|
|
int main(int *argc, char **argv) {
|
2023-11-12 20:43:33 +09:00
|
|
|
signal(SIGINT, finish);
|
2023-11-12 21:20:31 +09:00
|
|
|
initscr();
|
|
|
|
keypad(stdscr, TRUE);
|
2023-11-13 11:52:21 +09:00
|
|
|
nonl(); // \r instead of \r\n
|
2023-11-12 21:20:31 +09:00
|
|
|
cbreak();
|
|
|
|
noecho();
|
2023-11-13 00:53:57 +09:00
|
|
|
mousemask(BUTTON1_CLICKED, NULL);
|
2023-11-12 20:43:33 +09:00
|
|
|
|
|
|
|
struct ut_state state = ut_initial;
|
2023-11-12 19:57:13 +09:00
|
|
|
while (true) {
|
2023-11-13 00:53:57 +09:00
|
|
|
int r, c, err;
|
2023-11-13 11:52:21 +09:00
|
|
|
erase();
|
2023-11-13 00:53:57 +09:00
|
|
|
ut_draw(&state);
|
2023-11-12 19:57:13 +09:00
|
|
|
char w = ut_winner((char *)state.boards, 0, 3);
|
|
|
|
if(w)
|
|
|
|
{
|
2023-11-12 20:43:33 +09:00
|
|
|
if(w == ' ')
|
|
|
|
{
|
2023-11-13 11:52:21 +09:00
|
|
|
mvaddstr(21, 0, "Draw!");
|
2023-11-12 20:43:33 +09:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2023-11-13 11:52:21 +09:00
|
|
|
mvaddch(21, 0, w);
|
|
|
|
mvaddstr(21, 1, " Wins!");
|
2023-11-12 20:43:33 +09:00
|
|
|
}
|
2023-11-13 11:52:21 +09:00
|
|
|
mvaddstr(22, 0, "Press any key to exit.");
|
2023-11-13 00:53:57 +09:00
|
|
|
refresh();
|
|
|
|
mousemask(0, NULL);
|
|
|
|
getch();
|
|
|
|
break;
|
2023-11-12 19:57:13 +09:00
|
|
|
}
|
2023-11-13 11:52:21 +09:00
|
|
|
err = ut_click(&state, &r, &c);
|
|
|
|
if (err) {continue;}
|
|
|
|
err = ut_move(&state, &state, r, c);
|
|
|
|
if (err) {continue;}
|
2023-11-12 19:57:13 +09:00
|
|
|
}
|
2023-11-13 00:53:57 +09:00
|
|
|
finish(0);
|
2023-11-12 19:57:13 +09:00
|
|
|
return 0;
|
2023-11-12 19:34:40 +09:00
|
|
|
}
|