to break no squares
61Upon the square — Square Square (skw[^a]r), n. [OF. esquarre, esquierre, F. [ e]querre a carpenter s square (cf. It. squadra), fr. (assumed) LL. exquadrare to make square; L. ex + quadrus a square, fr. quattuor four. See {Four}, and cf. {Quadrant}, {Squad},… …
62Upon the square with — Square Square (skw[^a]r), n. [OF. esquarre, esquierre, F. [ e]querre a carpenter s square (cf. It. squadra), fr. (assumed) LL. exquadrare to make square; L. ex + quadrus a square, fr. quattuor four. See {Four}, and cf. {Quadrant}, {Squad},… …
63Michel Ney — Michel Ney, Marshal of France Nickname Le Rougeaud, le Brave des Braves …
64Irish Legion — Established on 31 August 1803, the Irish Legion (French: Legion irlandaise ) was originally created for a proposed invasion of Ireland. The concept was to create a unit of trained Irish officers and NCO s who could incite the population of… …
65chess — chess1 /ches/, n. a game played by two persons, each with 16 pieces, on a chessboard. [1150 1200; ME < OF esches, pl. of eschec CHECK1] chess2 /ches/, n., pl. chess, chesses. one of the planks forming the roadway of a floating bridge. [1425 75;… …
66Australian handball — Original research|date=February 2008Unreferenced|date=April 2007Australian Handball is a popular schoolyard game in Australia and New Zealand. It is a variation of Chinese Handball, with many similarities to other Chinese Handball games, but more …
67Glossary of chess — See also: Outline of chess and Glossary of chess problems This page explains commonly used terms in chess in alphabetical order. Some of these have their own pages, like fork and pin. For a list of unorthodox chess pieces, see fairy chess… …
68List of chess terms — This page explains commonly used terms in chess in alphabetical order. Some of these have their own pages, like fork and pin. For a list of unorthodox chess pieces, see fairy chess piece; for a list of terms specific to chess problems, see chess… …
69Match Game — The Match Game logo used from 1978–1982. Format Game Show Created by Frank Wayne …
702-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …
