01-14-2023, 07:58 AM

Here is a new game described in https://boardgamegeek.com/thread/3007720...ract-forum.

It compiles very slowly probably due to the define structure needed to identify the patterns. and also evaluates slowly.

Is there a better approach to use for identifying regular polygon vertices on grids?

40 years ago I invented an unpublished game which used square locations in any orientation and size on a square grid.

I am sure others have had such ideas as well.

Also, I had great difficulty finding a construct for the snippet {(value Player (mover))} used as #4 in:

(results

from:#2

to:(intersection (sites (from) { #1 } rotations:True) #3)

(if

(!= 0

(size Array

(intersection

(intersection

(array (sites (from) { #1 } rotations:True))

(array (sites (to) { #1 } rotations:True))

)

(array #4) // This is a single site for the standard game..

) ) )

(from)

-1

))

For example (var "LT") or {(var "LT")} and several other approaches did not compile. Nor did treating the above as sites rather than arrays.

Please check out why intersection and difference (and possibly union) are so picky about working with single values...

It compiles very slowly probably due to the define structure needed to identify the patterns. and also evaluates slowly.

Is there a better approach to use for identifying regular polygon vertices on grids?

40 years ago I invented an unpublished game which used square locations in any orientation and size on a square grid.

I am sure others have had such ideas as well.

Also, I had great difficulty finding a construct for the snippet {(value Player (mover))} used as #4 in:

(results

from:#2

to:(intersection (sites (from) { #1 } rotations:True) #3)

(if

(!= 0

(size Array

(intersection

(intersection

(array (sites (from) { #1 } rotations:True))

(array (sites (to) { #1 } rotations:True))

)

(array #4) // This is a single site for the standard game..

) ) )

(from)

-1

))

For example (var "LT") or {(var "LT")} and several other approaches did not compile. Nor did treating the above as sites rather than arrays.

Please check out why intersection and difference (and possibly union) are so picky about working with single values...

**Attached Files**

Tri-It-Out! Submission.lud (Size: 8.35 KB / Downloads: 2)