1
0
Fork 0
nbsdgames/sudoku.c

532 lines
12 KiB
C
Raw Normal View History

2022-11-16 14:24:48 +00:00
/*
2019-03-20 14:16:33 +00:00
_
(_
_)UDOKU
2020-06-20 16:26:54 +00:00
Authored by abakh <abakh@tuta.io>
2021-04-23 13:39:03 +00:00
To the extent possible under law, the author(s) have dedicated all copyright and related and neighboring rights to this software to the public domain worldwide. This software is distributed without any warranty.
You should have received a copy of the CC0 Public Domain Dedication along with this software. If not, see <http://creativecommons.org/publicdomain/zero/1.0/>.
2019-03-20 14:16:33 +00:00
NOTE: This program is only made for entertainment porpuses. The puzzles are generated by randomly clearing tiles on the table and are guaranteed to have a solution , but are not guaranteed to have only one unique solution.
*/
2022-07-01 06:15:34 +00:00
#include "common.h"
2020-06-20 16:26:54 +00:00
byte _wait=0, waitcycles=0;//apparently 'wait' conflicts with a variable in a library macOS includes by default
byte py,px;
unsigned int filled;
chtype colors[6]={0};
2020-06-20 16:26:54 +00:00
#ifdef NO_VLA//the Plan9 compiler can not handle VLAs
#define size 3
#define s 9
#ifdef Plan9
// I hope this is approximately right
int round(float x)
{
int y;
if(x > 0)
y = (int)(x + 0.5); //int will round down, so if the decimal of x is .5 or higher this will round up.
else if(x < 0)
y = (int)(x - 0.5); // the same but opposite
return y;
}
#endif
2020-06-20 16:26:54 +00:00
#else
2021-09-08 05:04:06 +00:00
byte size=3,s=9;//s=size*size
#endif
2019-03-20 14:16:33 +00:00
void cross(byte sy,byte sx,chtype start,chtype middle,chtype end){ //to simplify drawing tables. doesn't draw a cross (why did I choose that name?)
mvaddch(sy,sx,start);
byte f = 2*size;
2020-06-20 16:26:54 +00:00
for(char n=1;n<size;++n){
2019-03-20 14:16:33 +00:00
mvaddch(sy,sx+f,middle);
f+=2*size;
}
mvaddch(sy,sx+f,end);
}
void table(byte sy,byte sx){ //empty table
byte l;//line
2020-06-20 16:26:54 +00:00
for(l=0;l<=size;++l){
for(byte y=0;y<=s+size;++y)
2019-03-20 14:16:33 +00:00
mvaddch(sy+y,sx+l*size*2,ACS_VLINE);
2020-06-20 16:26:54 +00:00
for(byte x=0;x<=s*2;++x)
2019-03-20 14:16:33 +00:00
mvaddch(sy+(size+1)*l,sx+x,ACS_HLINE);
}
cross(sy,sx,ACS_ULCORNER,ACS_TTEE,ACS_URCORNER);
2020-06-20 16:26:54 +00:00
for(l=1;l<size;++l)
2019-03-20 14:16:33 +00:00
cross(sy+l*size+l,sx,ACS_LTEE,ACS_PLUS,ACS_RTEE);
cross(sy+l*size+l,sx,ACS_LLCORNER,ACS_BTEE,ACS_LRCORNER);
}
byte sgn2int(char sgn){
if('0'<sgn && sgn <='9')
return sgn-'0';
if('a'<=sgn && sgn <='z')
return sgn-'a'+10;
if('A'<=sgn && sgn <= 'Z')
return sgn-'A'+36;
2020-05-18 18:59:29 +00:00
return 0;
2019-03-20 14:16:33 +00:00
}
char int2sgn(byte num){// convert integer to representing sign
if(0< num && num <= 9)
return num+'0';
else if(10<=num && num <=35)
return num-10+'a';
else if(36<=num && num <=51)
return num-36+'A';
return 0;
}
2021-09-08 05:04:06 +00:00
bool isvalid(byte ty,byte tx,char board[s][s]){ //is it allowed to place that char there?
2019-03-20 14:16:33 +00:00
char t= board[ty][tx];
if(!t)
return 0;
byte y,x;
2020-06-20 16:26:54 +00:00
for(y=0;y<s;++y){
2019-03-20 14:16:33 +00:00
if(board[y][tx] == t && y!=ty)
return 0;
}
2020-06-20 16:26:54 +00:00
for(x=0;x<s;++x){
2019-03-20 14:16:33 +00:00
if(board[ty][x] == t && x!= tx)
return 0;
}
byte sy=size*(ty/size);//square
byte sx=size*(tx/size);
2020-06-20 16:26:54 +00:00
for(y=0;y<size;++y){
for(x=0;x<size;++x){
2019-03-20 14:16:33 +00:00
if(board[sy+y][sx+x]==t && sy+y != ty && sx+x != tx)
return 0;
}
}
return 1;
}
2021-09-08 05:04:06 +00:00
void swap(char *a,char *b){
2021-10-15 08:05:57 +00:00
char sw=*a;
2021-09-08 05:04:06 +00:00
*a=*b;
2021-10-15 08:05:57 +00:00
*b=sw;
2021-09-08 05:04:06 +00:00
}
void random_order(char a[size]){
byte i;
for(i=0;i<size;++i){
a[i]=i;
}
for(i=0;i<size;++i){
swap(&a[rand()%size],&a[rand()%size]);
}
}
void swap_row(char board[s][s],byte row_a, byte row_b){
for(byte i=0;i<s;++i){
swap(&board[i][row_a],&board[i][row_b]);
}
}
void swap_col(char board[s][s],byte col_a, byte col_b){
for(byte i=0;i<s;++i){
swap(&board[col_a][i],&board[col_b][i]);
}
}
void swap_super_row(char board[s][s],byte row_a,byte row_b){
for(byte i=0;i<size;++i){
swap_row(board,row_a+i,row_b+i);
}
}
void swap_super_col(char board[s][s],byte col_a,byte col_b){
for(byte i=0;i<size;++i){
swap_col(board,col_a+i,col_b+i);
}
}
2019-03-20 14:16:33 +00:00
2021-09-08 05:04:06 +00:00
void cleanse(char board[s][s],char victim){
2020-06-20 16:26:54 +00:00
for(byte y=0;y<s;++y)
for(byte x=0;x<s;++x)
2019-03-20 14:16:33 +00:00
if(board[y][x]==victim)
board[y][x]=0;
}
2021-09-08 05:04:06 +00:00
2019-03-20 14:16:33 +00:00
bool fill_with(char board[s][s],char fillwith){//returns 1 on failure
byte firstx,x,tries=0;
Again:
2020-06-20 16:26:54 +00:00
++tries;
2019-03-20 14:16:33 +00:00
if (tries>s)
return 1;
2020-06-20 16:26:54 +00:00
for(byte y=0;y<s;++y){//there should be only one occurence of a number in a row, and this function makes use of this fact to improve generation speed
2019-07-30 18:13:10 +00:00
firstx=x=rand()%s;
2019-03-20 14:16:33 +00:00
while(1){
if(!board[y][x]){
board[y][x]=fillwith;
if(isvalid(y,x,board)){
break;
}
else{
board[y][x]=0;
goto Next;
}
}
else{
Next:
2020-06-20 16:26:54 +00:00
++x;
2019-03-20 14:16:33 +00:00
if(x==s)
x=0;
if(x==firstx){
2021-09-08 05:04:06 +00:00
cleanse(board,fillwith);
2019-03-20 14:16:33 +00:00
goto Again;
}
}
}
}
refresh();
return 0;
}
void fill(char board[s][s]){
2020-06-20 16:26:54 +00:00
for(byte num=1;num<=s;++num){//it fills random places in the board with 1s, then random places in the remaining space with 2s and so on...
2019-03-20 14:16:33 +00:00
if(num==4){//something that randomly happens
2019-04-04 02:48:54 +00:00
_wait=(_wait+1)%60;
if(!_wait && waitcycles<3)
2020-06-20 16:26:54 +00:00
++waitcycles;
2019-03-20 14:16:33 +00:00
}
if ( fill_with(board,int2sgn(num) ) ){
memset(board,0,s*s);
num=0;
2020-06-21 07:02:36 +00:00
mvaddstr(0,0,"My algorithm sucks, so you need to wait a bit ");//with animated dots to entertain the waiter
2019-03-20 14:16:33 +00:00
if(waitcycles==3)
mvaddstr(2,0,"(You can set SUDOKU_FASTGEN if you just want to see if it works)");
move(0,45);
2019-04-04 02:48:54 +00:00
for(byte b=0;b<_wait;b+=10)
2019-03-20 14:16:33 +00:00
addch('.');
}
}
}
2021-09-08 05:04:06 +00:00
void swap_instances(char board[s][s],char A,char B){
2019-03-20 14:16:33 +00:00
byte y,x;
2020-06-20 16:26:54 +00:00
for(y=0;y<s;++y){
for(x=0;x<s;++x){
2019-03-20 14:16:33 +00:00
if(board[y][x]==A)
board[y][x]=B;
else if(board[y][x]==B)
board[y][x]=A;
}
}
}
2021-09-08 05:04:06 +00:00
void just_fill(char board[s][s]){//sometimes fill() gets too much , and you just want a 49x49 sudoku puzzle of any quality
2019-03-20 14:16:33 +00:00
byte y,x,k;//k is here to minimize calls to isvalid()
2020-06-20 16:26:54 +00:00
for(y=0;y<s;++y){//fill with 1,2,3,4...
2019-03-20 14:16:33 +00:00
k=1;
2020-06-20 16:26:54 +00:00
for(x=0;x<s;++x){
2019-03-20 14:16:33 +00:00
board[y][x]=int2sgn(k);
while(!isvalid(y,x,board)){
board[y][x]=int2sgn(k=k+1);
if(k>s)
board[y][x]=int2sgn(k=1);
}
2020-06-20 16:26:54 +00:00
++k;
2019-03-20 14:16:33 +00:00
if(k>s)
k=1;
}
}
2020-06-20 16:26:54 +00:00
for(byte n=0;n<s*2;++n)//randomize
2021-09-08 05:04:06 +00:00
swap_instances(board,int2sgn(1+(rand()%s)),int2sgn(1+(rand()%s)) );
2019-03-20 14:16:33 +00:00
}
2021-09-08 05:04:06 +00:00
void mk_puzzle(char board[s][s],char empty[s][s],char game[s][s]){//makes a puzzle to solve
2019-03-20 14:16:33 +00:00
byte y,x;
2020-06-20 16:26:54 +00:00
for(y=0;y<s;++y){
for(x=0;x<s;++x){
2021-09-08 05:04:06 +00:00
if( (size+x+y)%2==0 ){
2019-03-20 14:16:33 +00:00
empty[y][x]=board[y][x];
game[y][x]=board[y][x];
}
}
}
2021-09-08 05:04:06 +00:00
char order[size];
byte h=0,i=0,j=0;
for(h=0;h<s;++h){
for(i=0;i<size;++i){
random_order(order);
for(j=0;j<size;++j){
swap_row(empty,size*i+j,size*i+order[j]);
swap_row(game,size*i+j,size*i+order[j]);
swap_row(board,size*i+j,size*i+order[j]);
}
random_order(order);
for(j=0;j<size;++j){
swap_col(empty,size*i+j,size*i+order[j]);
swap_col(game,size*i+j,size*i+order[j]);
swap_col(board,size*i+j,size*i+order[j]);
}
random_order(order);
for(j=0;j<size;++j){
swap_super_row(empty,size*i,size*order[j]);
swap_super_row(game,size*i,size*order[j]);
swap_super_row(board,size*i,size*order[j]);
}
random_order(order);
for(j=0;j<size;++j){
swap_super_col(empty,size*i,size*order[j]);
swap_super_col(game,size*i,size*order[j]);
swap_super_col(board,size*i,size*order[j]);
}
}
}
2019-03-20 14:16:33 +00:00
}
void header(byte sy,byte sx){
mvaddch(sy, sx+1, '_');
mvprintw(sy+1,sx,"(_ Solved:%d/%d",filled,s*s);
mvprintw(sy+2,sx," _)UDOKU Left :%d/%d",s*s-filled,s*s);
}
void draw(byte sy,byte sx,char empty[s][s],char game[s][s]){
chtype attr;
table(sy,sx);
filled=0;
2020-06-20 16:26:54 +00:00
for(byte y=0;y<s;++y){
for(byte x=0;x<s;++x){
2019-03-20 14:16:33 +00:00
attr=A_NORMAL;
if(x==px && y==py)
attr |= A_STANDOUT;
if(empty[y][x])
attr |= A_BOLD;
if(game[y][x]){
if(!isvalid(y,x,game))
attr |= colors[5];
else{
attr |= colors[game[y][x]%5];
2020-06-20 16:26:54 +00:00
++filled;
2019-03-20 14:16:33 +00:00
}
mvaddch(sy+y+y/size+1,sx+x*2+1,attr|game[y][x]);
}
else
mvaddch(sy+y+y/size+1,sx+x*2+1,attr|' ');
}
}
}
void sigint_handler(int x){
endwin();
puts("Quit.");
exit(x);
}
void mouseinput(int sy, int sx){
2020-09-12 10:38:45 +00:00
#ifndef NO_MOUSE
2020-05-18 18:59:29 +00:00
MEVENT m;
2019-08-17 20:42:16 +00:00
#ifdef PDCURSES
2020-05-18 18:59:29 +00:00
nc_getmouse(&m);
2019-08-17 20:42:16 +00:00
#else
getmouse(&m);
#endif
2020-05-18 18:59:29 +00:00
if( m.y < (3+1+size+s)-sy && m.x<(2*s+1)-sx ){//it's a shame to include math.h only for round() but it was the only moral way to make gcc shut up
py= round( (float)(size*(m.y-4-sy))/(size+1) );//these are derived from the formulas in draw() by simple algebra
px=(m.x-1-sx)/2;
}
else
return;
if(m.bstate & BUTTON1_CLICKED)
ungetch('\n');
if(m.bstate & (BUTTON2_CLICKED|BUTTON3_CLICKED) )
ungetch(' ');
2020-09-12 10:38:45 +00:00
#endif //NO_MOUSE
2019-03-20 14:16:33 +00:00
}
void help(void){
erase();
header(0,0);
attron(A_BOLD);
mvprintw(3,0," **** THE CONTROLS ****");
mvprintw(13,0,"YOU CAN ALSO USE THE MOUSE!");
attroff(A_BOLD);
mvprintw(4,0,"1 - %c : Enter number/character",int2sgn(s));
mvprintw(5,0,"SPACE : Clear tile");
mvprintw(6,0,"ARROW KEYS : Move cursor");
mvprintw(7,0,"q : Quit");
mvprintw(8,0,"n : New board");
mvprintw(9,0,"r : Restart");
if(size>4)
2021-04-20 11:22:52 +00:00
printw(" (some of these alphabet controls maybe overridden in certain sizes)");
2019-03-20 14:16:33 +00:00
mvprintw(10,0,"? : Hint (not like in other games)");
mvprintw(11,0,"F1 & F2: Help on controls & gameplay");
mvprintw(12,0,"PgDn,PgUp,<,> : Scroll");
mvprintw(15,0,"Press a key to continue");
refresh();
getch();
erase();
}
void gameplay(void){
2020-05-18 18:59:29 +00:00
erase();
header(0,0);
attron(A_BOLD);
mvprintw(3,0," **** THE GAMEPLAY ****");
2019-03-20 14:16:33 +00:00
attroff(A_BOLD);
move(4,0);
printw("Fill the table with digits");
if(size>3)
printw(" (and characters) \n");
else
addch('\n');
printw("so that all the rows, columns and smaller subregions \n");
printw("contain all of the digits from 1 to ");
if(size<=3){
addch(int2sgn(s));
addch('.');
}
if(size>3){
addch('9');
printw(" and all\nthe alphabet letters from 'a' to '%c'.",int2sgn(s));
}
printw("\n\nPress a key to continue.");
2020-05-18 18:59:29 +00:00
refresh();
getch();
erase();
2019-03-20 14:16:33 +00:00
}
int main(int argc,char** argv){
signal(SIGINT,sigint_handler);
2021-09-08 05:04:06 +00:00
bool fastgen=0;
2021-08-16 14:54:22 +00:00
int opt;
while( (opt=getopt(argc,argv,"hfs:d:"))!=-1){
switch(opt){
#ifndef NO_VLA
2021-08-16 14:54:22 +00:00
case 's':
size=atoi(optarg);
if(size>7 || size<2){
printf("2 <= size <= 7\n");
return EXIT_FAILURE;
}
break;
#endif //NO_VLA
case 'f':
fastgen=1;
break;
case 'h':
default:
2021-09-08 05:04:06 +00:00
printf("Usage:%s [options]\n -s size\n -h help\n -f fast (flawed) generation\n",argv[0]);
2021-08-16 14:54:22 +00:00
return EXIT_FAILURE;
break;
2020-06-20 16:26:54 +00:00
}
}
2021-08-16 14:54:22 +00:00
2021-09-08 05:04:06 +00:00
fastgen= (size>4) || fastgen || !(!getenv("SUDOKU_FASTGEN"));
2019-03-20 14:16:33 +00:00
initscr();
2020-09-12 10:38:45 +00:00
#ifndef NO_MOUSE
2020-05-18 18:59:29 +00:00
mousemask(ALL_MOUSE_EVENTS,NULL);
2020-09-12 10:38:45 +00:00
#endif //NO_MOUSE
2020-05-18 18:59:29 +00:00
noecho();
cbreak();
keypad(stdscr,1);
srand(time(NULL)%UINT_MAX);
2019-03-20 14:16:33 +00:00
if( has_colors() ){
2020-05-18 18:59:29 +00:00
start_color();
use_default_colors();
init_pair(1,COLOR_YELLOW,-1);
init_pair(2,COLOR_GREEN,-1);
init_pair(3,COLOR_BLUE,-1);
init_pair(4,COLOR_CYAN,-1);
init_pair(5,COLOR_MAGENTA,-1);
init_pair(6,COLOR_RED,-1);
2020-06-20 16:26:54 +00:00
for(byte b=0;b<6;++b){
2020-05-18 18:59:29 +00:00
colors[b]=COLOR_PAIR(b+1);
}
}
#ifndef NO_VLA
2019-03-20 14:16:33 +00:00
s= size*size;
#endif
2019-03-20 14:16:33 +00:00
char board[s][s];
2020-05-18 18:59:29 +00:00
char empty[s][s];
char game[s][s];
2019-03-20 14:16:33 +00:00
int input=0;
int sy,sx;
Start:
sy=sx=0;
erase();
curs_set(0);
filled =0;
memset(board,0,s*s);
memset(empty,0,s*s);
memset(game,0,s*s);
if(fastgen)
2021-09-08 05:04:06 +00:00
just_fill(board);
2019-03-20 14:16:33 +00:00
else
fill(board);
2021-09-08 05:04:06 +00:00
mk_puzzle(board,empty,game);
2019-03-20 14:16:33 +00:00
py=px=0;
while(1){
erase();
draw(sy+3,sx+0,empty,game);
header(sy+0,sx+0);
refresh();
if(filled == s*s)
break;
input = getch();
if( input==KEY_PPAGE && LINES< s+size+3){//the board starts in 3
2020-05-18 18:59:29 +00:00
sy+=10;
if(sy>0)
sy=0;
}
if( input==KEY_NPAGE && LINES< s+size+3){
sy-=10;
if(sy< -(s+size+3) )
sy=-(s+size+3);
}
if( input=='<' && COLS< s*2){
sx+=10;
if(sx>0)
sx=0;
}
if( input=='>' && COLS< s*2){
sx-=10;
if(sx< -(s*2))
sx=-(s*2);
}
2019-03-20 14:16:33 +00:00
if(input == KEY_F(1))
help();
2022-02-02 12:39:13 +00:00
if((input==KEY_F(2)||input=='!'))
2019-03-20 14:16:33 +00:00
gameplay();
if(input == KEY_MOUSE)
mouseinput(sy,sx);
if(input == KEY_UP && py)
2020-06-20 16:26:54 +00:00
--py;
2022-02-02 03:35:29 +00:00
if((input==KEY_DOWN||input=='s') && py<s-1)
2020-06-20 16:26:54 +00:00
++py;
2022-02-02 03:35:29 +00:00
if((input==KEY_LEFT||input=='a') && px)
2020-06-20 16:26:54 +00:00
--px;
2022-02-02 03:35:29 +00:00
if((input==KEY_RIGHT||input=='d') && px<s-1)
2020-06-20 16:26:54 +00:00
++px;
2019-03-20 14:16:33 +00:00
if(!empty[py][px]){
if(input == ' ' )
game[py][px]=0;
else if(input<=CHAR_MAX && sgn2int(input) && sgn2int(input)<=s )
game[py][px]=input;
}
2022-02-02 12:39:13 +00:00
if( ((input=='q'||input==27) && size<= 5) || input=='Q')
2019-03-20 14:16:33 +00:00
sigint_handler(EXIT_SUCCESS);
if(input=='n'&& size <= 4)
goto Start;
if(input=='r'&& size <= 5){
byte y,x;
2020-06-20 16:26:54 +00:00
for(y=0;y<s;++y)
for(x=0;x<s;++x)
2019-03-20 14:16:33 +00:00
game[y][x]=empty[y][x];
}
if(input=='?')
game[py][px]=board[py][px];
if(input == 'X' && getch()=='Y' && getch()=='Z' && getch()=='Z' && getch()=='Y'){
byte y,x;
2020-06-20 16:26:54 +00:00
for(y=0;y<s;++y)
for(x=0;x<s;++x)
2019-03-20 14:16:33 +00:00
game[y][x]=board[y][x];
}
}
mvprintw(sy+s+size+4,sx+0,"Yay!! Wanna play again?(y/n)");
curs_set(1);
input=getch();
if(input != 'N' && input != 'n' && input != 'q')
goto Start;
endwin();
return EXIT_SUCCESS;
}