Set puzzle: Difference between revisions
Content added Content deleted
No edit summary |
m (→{{header|REXX}}: added/changed whitespace and comments, removed some superfluous logic statements.) |
||
Line 2,208: | Line 2,208: | ||
The particular set of cards dealt (show below) used Regina 3.90 under a Windows/XP environment. |
The particular set of cards dealt (show below) used Regina 3.90 under a Windows/XP environment. |
||
<lang rexx>/*REXX program finds "sets" (solutions) for the SET puzzle (game). */ |
<lang rexx>/*REXX program finds "sets" (solutions) for the SET puzzle (game). */ |
||
parse arg game seed . /*get optional # cards to deal |
parse arg game seed . /*get optional # cards to deal and seed*/ |
||
if game ==',' | game=='' then game=9 /*Not specified? Then use default*/ |
if game ==',' | game=='' then game=9 /*Not specified? Then use the default.*/ |
||
if seed==',' | seed=='' then seed=77 /* " " " " " */ |
if seed==',' | seed=='' then seed=77 /* " " " " " " */ |
||
call aGame 0 /*with tell=0 |
call aGame 0 /*with tell=0: suppress the output. */ |
||
call aGame 1 /*with tell=1 |
call aGame 1 /*with tell=1: display " " */ |
||
exit sets /*stick a fork in it, we're done.*/ |
exit sets /*stick a fork in it, we're all done. */ |
||
/*──────────────────────────────────AGAME |
/*──────────────────────────────────AGAME subroutine──────────────────────────*/ |
||
aGame: tell=arg(1); good=game%2 /*enable |
aGame: tell=arg(1); good=game%2 /*enable/disable the showing of output.*/ |
||
/* [↑] GOOD is the right # |
/* [↑] the GOOD var is the right #sets*/ |
||
do seed=seed until good==sets /*generate deals until good# sets*/ |
do seed=seed until good==sets /*generate deals until good # of sets.*/ |
||
call random ,,seed /*repeatability for |
call random ,,seed /*repeatability for the RANDOM invokes.*/ |
||
call genFeatures /*generate various card features.*/ |
call genFeatures /*generate various card game features. */ |
||
call genDeck /*generate a deck (with 81 cards)*/ |
call genDeck /*generate a deck (with 81 "cards").*/ |
||
call dealer game /*deal a number of cards |
call dealer game /*deal a number of cards for the game. */ |
||
call findSets game%2 /*find sets from the dealt cards.*/ |
call findSets game%2 /*find # of sets from the dealt cards. */ |
||
end /*until*/ /*when leaving, SETS is right |
end /*until*/ /* [↓] when leaving, SETS is right #.*/ |
||
return /*return to invoker of this |
return /*return to invoker of this subroutine.*/ |
||
/*──────────────────────────────────DEALER |
/*──────────────────────────────────DEALER subroutine─────────────────────────*/ |
||
dealer: call sey 'dealing' game "cards:",,. /*shuffle and deal cards*/ |
dealer: call sey 'dealing' game "cards:",,. /*shuffle and deal the cards. */ |
||
do cards=1 until cards==game /*keep dealing |
do cards=1 until cards==game /*keep dealing until finished.*/ |
||
_=random(1,words(##)); ##=delword(##,_,1) |
_=random(1,words(##)); ##=delword(##,_,1) /*pick card; delete a card. */ |
||
@.cards=deck._ /*add |
@.cards=deck._ /*add the card to the tableau.*/ |
||
call sey right('card' cards,30) " " @.cards /*display card to screen*/ |
call sey right('card' cards,30) " " @.cards /*display the card to screen. */ |
||
do j=1 for words(@.cards) /*define cells for |
do j=1 for words(@.cards) /* [↓] define cells for cards*/ |
||
@.cards.j=word(@.cards,j) /*define a cell for card*/ |
@.cards.j=word(@.cards,j) /*define a cell for a card.*/ |
||
end /*j*/ |
end /*j*/ |
||
end /*cards*/ |
end /*cards*/ |
||
return |
return |
||
/*──────────────────────────────────DEFFEATURES |
/*──────────────────────────────────DEFFEATURES subroutine────────────────────*/ |
||
defFeatures: parse arg what,v; _=words(v) /*obtain what to |
defFeatures: parse arg what,v; _=words(v) /*obtain what is to be defined*/ |
||
if _\==values then do; call sey 'error,' what "features ¬=" values,.,. |
if _\==values then do; call sey 'error,' what "features ¬=" values,.,. |
||
exit -1 |
exit -1 |
||
end /* [↑] check for typos |
end /* [↑] check for typos/errors*/ |
||
do k=1 for words(values) /*define all |
do k=1 for words(values) /*define all the possible vals*/ |
||
call value what'.'k, word(values,k) /*define a card feature.*/ |
call value what'.'k, word(values,k) /*define a card feature. */ |
||
end /*k*/ |
end /*k*/ |
||
return |
return |
||
/*──────────────────────────────────GENDECK |
/*──────────────────────────────────GENDECK subroutine────────────────────────*/ |
||
genDeck: #=0; ##= /*#cards in deck; ## |
genDeck: #=0; ##= /*#: cards in deck; ##: shuffle aid.*/ |
||
do num=1 for values; xnum=word(numbers, num) |
do num=1 for values; xnum = word(numbers, num) |
||
do col=1 for values; xcol=word(colors, col) |
do col=1 for values; xcol = word(colors, col) |
||
do sym=1 for values; xsym=word(symbols, sym) |
do sym=1 for values; xsym = word(symbols, sym) |
||
do sha=1 for values; xsha=word(shadings, sha) |
do sha=1 for values; xsha = word(shadings, sha) |
||
#=#+1; ##=## #; deck.#=xnum xcol xsym xsha /*create a card.*/ |
#=#+1; ##=## #; deck.#=xnum xcol xsym xsha /*create a card.*/ |
||
end /*sha*/ |
end /*sha*/ |
||
end /*num*/ |
end /*num*/ |
||
end /*sym*/ |
end /*sym*/ |
||
end /*col*/ |
end /*col*/ |
||
return /*#: the number of cards in deck.*/ |
return /*#: the number of cards in the deck. */ |
||
/*──────────────────────────────────GENFEATURES |
/*──────────────────────────────────GENFEATURES subroutine────────────────────*/ |
||
genFeatures: features=3; groups=4; values=3 |
genFeatures: features=3; groups=4; values=3 /*define # features, groups, vals.*/ |
||
numbers = 'one two three' ; call defFeatures 'number', numbers |
numbers = 'one two three' ; call defFeatures 'number', numbers |
||
colors = 'red green purple' ; call defFeatures 'color', colors |
colors = 'red green purple' ; call defFeatures 'color', colors |
||
symbols = 'oval squiggle diamond' ; call defFeatures 'symbol', symbols |
symbols = 'oval squiggle diamond' ; call defFeatures 'symbol', symbols |
||
shadings= 'solid open striped' ; call defFeatures 'shading', shadings |
shadings= 'solid open striped' ; call defFeatures 'shading', shadings |
||
return |
return |
||
/*──────────────────────────────────GENPOSS |
/*──────────────────────────────────GENPOSS subroutine────────────────────────*/ |
||
genPoss: p=0; sets=0; sep=' ───── '; !.= /*define some REXX variables.*/ |
genPoss: p=0; sets=0; sep=' ───── '; !.= /*define some REXX variables. */ |
||
do i=1 for game /* [↓] the IFs eliminate |
do i=1 for game /* [↓] the IFs eliminate duplicates.*/ |
||
do j=i+1 to game |
do j=i+1 to game |
||
do k=j+1 to game |
do k=j+1 to game |
||
p=p+1; !.p.1=@.i; !.p.2=@.j; !.p.3=@.k |
p=p+1; !.p.1=@.i; !.p.2=@.j; !.p.3=@.k |
||
end /*k*/ |
end /*k*/ |
||
end /*j*/ |
end /*j*/ |
||
end /*i*/ /* [↑] |
end /*i*/ /* [↑] generate the permutation list. */ |
||
return |
return |
||
/*──────────────────────────────────FINDSETS |
/*──────────────────────────────────FINDSETS subroutine───────────────────────*/ |
||
findSets: parse arg n; call genPoss /*N: the number of sets to |
findSets: parse arg n; call genPoss /*N: the number of sets to be found. */ |
||
call sey /*find any sets |
call sey /*find any sets that were generated [↑]*/ |
||
do j=1 for p /*P is the |
do j=1 for p /*P: is the number of possible sets. */ |
||
do f=1 for features |
do f=1 for features |
||
do g=1 for groups; !!.j.f.g=word(!.j.f, g) |
do g=1 for groups; !!.j.f.g=word(!.j.f, g) |
||
end /*g*/ |
end /*g*/ |
||
end /*f*/ |
end /*f*/ |
||
ok=1 /*everything is OK |
ok=1 /*everything is peachy─kean (OK) so far*/ |
||
do g=1 for groups; _=!!.j.1.g /* |
do g=1 for groups; _=!!.j.1.g /*build strings to hold possibilities. */ |
||
equ=1 /* [↓] handles all equal |
equ=1 /* [↓] handles all the equal features.*/ |
||
do f=2 to features while equ; equ=equ & _==!!.j.f.g |
do f=2 to features while equ; equ=equ & _==!!.j.f.g |
||
end /*f*/ |
end /*f*/ |
||
dif=1 |
dif=1 |
||
__=!!.j.1.g /* [↓] handles all unequal |
__=!!.j.1.g /* [↓] handles all unequal features.*/ |
||
do f=2 to features while \equ |
do f=2 to features while \equ |
||
dif=dif & wordpos(!!.j.f.g,__)==0 |
dif=dif & (wordpos(!!.j.f.g,__)==0) |
||
__=__ !!.j.f.g /*append to string for next test.*/ |
__=__ !!.j.f.g /*append to the string for next test. */ |
||
end /*f*/ |
end /*f*/ |
||
ok=ok&(equ|dif) |
ok=ok & (equ | dif) /*now, see if all are equal or unequal.*/ |
||
end /*g*/ |
end /*g*/ |
||
if \ok then iterate /*Is this set OK? Nope, skip it.*/ |
if \ok then iterate /*Is this set OK? Nope, then skip it.*/ |
||
sets=sets+1 /*bump the number of sets found. */ |
sets=sets+1 /*bump the number of the sets found. */ |
||
call sey right('set' sets": ",15) !.j.1 sep !.j.2 sep !.j.3 |
call sey right('set' sets": ",15) !.j.1 sep !.j.2 sep !.j.3 |
||
end /*j*/ |
end /*j*/ |
||
call sey sets 'sets found.',. |
call sey sets 'sets found.',. |
||
return |
return |
||
/*──────────────────────────────────SEY |
/*──────────────────────────────────SEY subroutine────────────────────────────*/ |
||
sey: if \tell then return |
sey: if \tell then return /*¬ tell? Then suppress the output. */ |
||
if arg(2)==. then say; say arg(1); if arg(3)==. then say; return</lang> |
if arg(2)==. then say; say arg(1); if arg(3)==. then say; return</lang> |
||
'''output''' when using the default input: |
'''output''' when using the default input: |
||
<pre> |
<pre> |