mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-21 08:01:30 -07:00
Files
6b9e690c89
grid generation to arrange a mine layout that never requires guessing. [originally from svn r5859]
45 lines
1.0 KiB
C
45 lines
1.0 KiB
C
/*
|
|
* list.c: List of puzzles.
|
|
*/
|
|
|
|
#include "puzzles.h"
|
|
|
|
/*
|
|
* The available games can be most easily enumerated by searching
|
|
* for the line in each game source file saying "#define thegame
|
|
* <gamename>". Hence, the following piece of shell/Perl should
|
|
* regenerate this list automatically:
|
|
|
|
perl -ne '/^#define thegame (\S+)/ and $1 ne "nullgame" and print "extern const game $1;\n"' *.c
|
|
echo -e '\nconst game *gamelist[] = {'
|
|
perl -ne '/^#define thegame (\S+)/ and $1 ne "nullgame" and print " &$1,\n"' *.c
|
|
echo -e '};\n\nconst int gamecount = lenof(gamelist);'
|
|
|
|
*/
|
|
|
|
extern const game cube;
|
|
extern const game fifteen;
|
|
extern const game mines;
|
|
extern const game net;
|
|
extern const game netslide;
|
|
extern const game pattern;
|
|
extern const game rect;
|
|
extern const game sixteen;
|
|
extern const game solo;
|
|
extern const game twiddle;
|
|
|
|
const game *gamelist[] = {
|
|
&cube,
|
|
&fifteen,
|
|
&mines,
|
|
&net,
|
|
&netslide,
|
|
&pattern,
|
|
&rect,
|
|
&sixteen,
|
|
&solo,
|
|
&twiddle,
|
|
};
|
|
|
|
const int gamecount = lenof(gamelist);
|