Independence on Triangular Triangle Boards

Triangular parts of the Euclidean triangle tessellation of the plane are considered as gameboards Tn. Thirteen chess-like pieces are defined as in [1]. The independence number βn is the maximum number of non-attacking copies of a piece on Tn. For nine of the chess-like pieces βn is determined completely

minimum dominating set of queens: A trivial programming exercise?

Abstractminimum dominating set of queens is one of the typical programming exercises of a first year’s computer science course. However, little work has been published on the complexity of this problem. We analyse here several algorithms and show that advanced algorithmic techniques may dramatically speed up solving this problem

Square dancing: official magazine of the Sets in Order American Square Dance Society.

Published monthly for and by Square Dancers and for the general enjoyment of all