Some games using polyforms (pentominoes, hexiamonds) are considered.
The talk will deal with the question of what values the number of edges can take for APE-polygons on square, triangular and hexagonal grids.
We study n-polyiamonds with the restriction: Their sides lengths are all numbers between 1 and n in this order. Each polyiamond has a unique encoding in a 6-letter alphabet. We study formal grammars to describe interesting families of such polyiamonds.
We investigate conditions under which a poset equipped with a weak difference gives rise to a weak BCK-algebra whose subtraction operation coincides with the weak difference for comparable elements.