OFFSET
1,2
REFERENCES
Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 342-349.
J. Katzenelson and R. P. Kurshan, S/R: A Language for Specifying Protocols and Other Coordinating Processes, pp. 286-292 in Proc. IEEE Conf. Comput. Comm., 1986.
LINKS
Steven R. Finch, Hard Square Entropy Constant [Broken link]
Steven R. Finch, Hard Square Entropy Constant [From the Wayback machine]
EXAMPLE
Neighbors for n=4:
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
Neighbors for n=5:
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
PROG
(S/R)
proc a
stvar $[N][N]:boolean
init $[][] := false
cyset true
asgn $[][]->{false, true}
kill +[i in 0.. N-1](
+[j in 0.. N-1](
$[i][j]`*(
(
$[i][(j-1) mod N]`
+$[(i-1) mod N][j]`
+(
$[(i-1) mod N][(j-1) mod N]`
? ((j mod 2)=0) |
$[(i+1) mod N][(j-1) mod N]`
)
) ? ((j>0)+((N mod 2)=0)) | (
$[(i-1) mod N][j]`
+$[(i-1) mod N][(j-1) mod N]`
+$[(i+1) mod N][(j-1) mod N]` )))) end
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 25 2002
EXTENSIONS
More terms from Sean A. Irvine, Nov 18 2023
STATUS
approved