Data commit
This commit is contained in:
Ingy döt Net
parent
7387c8f97b
commit
cb5bb5e222
199093 changed files with 3378972 additions and 0 deletions
|
|
@ -0,0 +1,26 @@
|
|||
/*REXX program generates a random starting position for the Chess960 game. */
|
||||
parse arg seed . /*allow for (RANDOM BIF) repeatability.*/
|
||||
if seed\=='' then call random ,,seed /*if SEED was specified, use the seed.*/
|
||||
@.=. /*define the first rank as being empty.*/
|
||||
r1=random(1,6) /*generate the first rook: rank 1. */
|
||||
@.r1='R' /*place the first rook on rank1. */
|
||||
do until r2\==r1 & r2\==r1-1 & r2\==r1+1
|
||||
r2=random(1,8) /*find placement for the 2nd rook. */
|
||||
end /*forever*/
|
||||
@.r2='r' /*place the second rook on rank 1. */
|
||||
k=random(min(r1, r2)+1, max(r1, r2)-1) /*find a random position for the king. */
|
||||
@.k='K' /*place king between the two rooks. */
|
||||
do _=0 ; b1=random(1,8); if @.b1\==. then iterate; c=b1//2
|
||||
do forever; b2=random(1,8) /* c=color of bishop ►──┘ */
|
||||
if @.b2\==. | b2==b1 | b2//2==c then iterate /*is a bad position?*/
|
||||
leave _ /*found position for the 2 clergy*/
|
||||
end /*forever*/ /* [↑] find a place for the 1st bishop*/
|
||||
end /* _ */ /* [↑] " " " " " 2nd " */
|
||||
@.b1='B' /*place the 1st bishop on rank 1. */
|
||||
@.b2='b' /* " " 2nd " " " " */
|
||||
/*place the two knights on rank 1. */
|
||||
do until @._='N'; _=random(1,8); if @._\==. then iterate; @._='N'; end
|
||||
do until @.!='n'; !=random(1,8); if @.!\==. then iterate; @.!='n'; end
|
||||
_= /*only the queen is left to be placed. */
|
||||
do i=1 for 8; _=_ || @.i; end /*construct the output: first rank only*/
|
||||
say translate(translate(_, 'q', .)) /*stick a fork in it, we're all done. */
|
||||
|
|
@ -0,0 +1,38 @@
|
|||
/*REXX program generates all random starting positions for the Chess960 game. */
|
||||
parse arg seed . /*allow for (RANDOM BIF) repeatability.*/
|
||||
if seed\=='' then call random ,,seed /*if SEED was specified, use the seed.*/
|
||||
x.=0; #=0; rg='random generations: ' /*initialize game placeholder; # games.*/
|
||||
/*▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒*/
|
||||
do t=1 /* [↓] display every 1,000 generations*/ /*▒*/
|
||||
if t//1000==0 then say right(t,9) rg # " unique starting positions." /*▒*/
|
||||
@.=. /*define the first rank as being empty.*/ /*▒*/
|
||||
r1=random(1,6) /*generate the first rook: rank 1. */ /*▒*/
|
||||
@.r1='R' /*place the first rook on rank1. */ /*▒*/
|
||||
do until r2\==r1 & r2\==r1-1 & r2\==r1+1 /*▒*/
|
||||
r2=random(1,8) /*find placement for the 2nd rook. */ /*▒*/
|
||||
end /*forever*/ /*▒*/
|
||||
@.r2='r' /*place the second rook on rank 1. */ /*▒*/
|
||||
k=random(min(r1, r2)+1, max(r1, r2)-1) /*find a random position for the king. */ /*▒*/
|
||||
@.k='K' /*place king between the two rooks. */ /*▒*/
|
||||
do _=0 ; b1=random(1,8); if @.b1\==. then iterate; c=b1//2 /*▒*/
|
||||
do forever; b2=random(1,8) /* c=color of bishop ►──┘ */ /*▒*/
|
||||
if @.b2\==. | b2==b1 | b2//2==c then iterate /*is a bad position?*/ /*▒*/
|
||||
leave _ /*found position for the 2 clergy*/ /*▒*/
|
||||
end /*forever*/ /* [↑] find a place for the 1st bishop*/ /*▒*/
|
||||
end /* _ */ /* [↑] " " " " " 2nd " */ /*▒*/
|
||||
@.b1='B' /*place the 1st bishop on rank 1. */ /*▒*/
|
||||
@.b2='b' /* " " 2nd " " " " */ /*▒*/
|
||||
/*place the two knights on rank 1. */ /*▒*/
|
||||
do until @._='N'; _=random(1,8); if @._\==. then iterate; @._='N'; end /*▒*/
|
||||
do until @.!='n'; !=random(1,8); if @.!\==. then iterate; @.!='n'; end /*▒*/
|
||||
_= /*only the queen is left to be placed. */ /*▒*/
|
||||
do i=1 for 8; _=_ || @.i; end /*construct the output: first rank only*/ /*▒*/
|
||||
upper _ /*uppercase all the chess pieces. */ /*▒*/
|
||||
if x._ then iterate /*This position found before? Skip it.*/ /*▒*/
|
||||
x._=1 /*define this position as being found. */ /*▒*/
|
||||
#=#+1 /*bump the # of unique positions found,*/ /*▒*/
|
||||
if #==960 then leave /*▒*/
|
||||
end /*t ▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒*/
|
||||
|
||||
say # 'unique starting positions found after ' t "generations."
|
||||
/*stick a fork in it, we're all done. */ /**/
|
||||
|
|
@ -0,0 +1,61 @@
|
|||
/*---------------------------------------------------------------
|
||||
* Compute the 960 possible solutions
|
||||
* There must be at least one field between the rooks
|
||||
* The king is positioned on any field between the rooks
|
||||
* The queen is placed on any unoccupied field
|
||||
* bishops are placed so that they are on different colored fields
|
||||
* what remains are the kNights...
|
||||
*--------------------------------------------------------------*/
|
||||
cnt.=0
|
||||
Call time 'R'
|
||||
Do r1=1 To 6
|
||||
Do r2=r1+1 To 8
|
||||
Do kk=r1+1 To r2-1
|
||||
poss=space(translate('12345678',' ',r1||kk||r2),0)
|
||||
Call rest
|
||||
End
|
||||
|
||||
End
|
||||
End
|
||||
say cnt.1 'solutions'
|
||||
Say time('E')
|
||||
Exit
|
||||
|
||||
rest:
|
||||
Do i=1 To 5
|
||||
q=substr(poss,i,1)
|
||||
br=space(translate(poss,' ',q),0)
|
||||
Do b1i=1 To 3
|
||||
Do b2i=b1i+1 To 4
|
||||
Call finish
|
||||
End
|
||||
End
|
||||
End
|
||||
Return
|
||||
|
||||
finish:
|
||||
b1=substr(br,b1i,1)
|
||||
b2=substr(br,b2i,1)
|
||||
If (b1+b2)//2>0 Then
|
||||
Call out
|
||||
Return
|
||||
|
||||
out:
|
||||
pos.='N'
|
||||
pos.r1='R'
|
||||
pos.r2='R'
|
||||
pos.kk='K'
|
||||
pos.q='Q'
|
||||
pos.b1='B'
|
||||
pos.b2='B'
|
||||
ol=''
|
||||
Do k=1 To 8
|
||||
ol=ol||pos.k
|
||||
End
|
||||
cnt.1=cnt.1+1
|
||||
If cnt.1<4 |,
|
||||
cnt.1>957 Then
|
||||
Say format(cnt.1,3) poss r1 kk r2 ol
|
||||
If cnt.1=4 Then
|
||||
Say ' ...'
|
||||
Return
|
||||
Loading…
Add table
Add a link
Reference in a new issue