Patent US3687455A successfully refreshed from Google Patents.
US3687455A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Set of playing pieces
Assignee: Individual
•
Filing: 1970-06-22
•
Granted: 1972-08-29
•
Expires: 1990-06-22
Abstract
Abstract The present invention is concerned with various improvements in the game forming the subject of copending U.S. Pat. Application, Ser. No. 787,162, filed Dec. 26, 1968, in which the game described comprises a set of polygonal playing pieces similar in shape and in dimensions, each apex of each piece carrying a conventional value chosen from a plurality of possible values, the number of pieces of the set being such that all the possible combinations of said values are reproduced once and only once. According to one of these improvements, the playing pieces also carry a further conventional value in at least one additional point, known as site, intermediate between two of their apices. In one embodiment of the invention the pieces have the form of a regular trapezoid with the long base twice the length of the small base and the oblique sides, the site being located on the long base. In another embodiment the pieces are isosceles triangles with two equal sides twice the length/of of the third side and each having a site located thereon.
Inventors
- 👤 Marc Odier
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 09:25
CPC Classifications
A; A63; A63F; A63F9/00; A63F9/06; A63F9/0669; A63F9/20; A63F2009/067; A63F2009/0673; A63F2009/0677; A63F2009/0683; A63F2009/069; A63F2009/0695; A63F2009/0697
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
211 words
A game comprising at least one set of identical pieces with N apices and N sides, values taken from M possible values arranged at each one of the N apices of each piece as well as at each one of the sites P arranged along at least one of the sides of the piece, P being equal to at least one, such that the distance separating any two adjacent values of a piece is the same for all the pieceS, each piece carrying Q N + P values defining a sequence having a predetermined reading order, and the number of pieces of said set being such that all the combinations of M values taken Q by Q are reproduced once and only once by the sequences carried by all the pieces of said set, according to said predetermined reading order, said pieces having the form of a regular trapezoid, the small base and the oblique sides of which are equal, the large base having a length twice that of the small base and of the oblique sides, each piece having a site arranged in the center of the large base, and in which for M 2, said game comprises a set of 32 pieces, the sequences of which are all different.
Claim 2
Dependent Claim
211 words
A game comprising at least one set of identical pieces with N apices and N sides, values taken from M possible values arranged at each one of the N apices of each piece as well as at each one of the sites P arranged along at least one of the sides of the piece, P being equal to at least one, such that the distance separating any two adjacent values of a piece is the same for all the pieceS, each piece carrying Q N + P values defining a sequence having a predetermined reading order, and the number of pieces of said set being such that all the combinations of M values taken Q by Q are reproduced once and only once by the sequences carried by all the pieces of said set, according to said predetermined reading order, said pieces having the form of a regular trapezoid, the small base and the oblique sides of which are equal, the large base having a length twice that of the small base and of the oblique sides, each piece having a site arranged in the center of the large base, and in which for M 2, said game comprises a set of 32 pieces, the sequences of which are all different.
Claim 3
Dependent Claim
197 words
A game comprising at least one set of identical pieces with N apices and N sides, values taken from M possible values arranged at each one of the N apices of each piece as well as at each one of the sites P arranged along at least one of the sides of the piece, P being equal to at least one, such that the distance separating any two adjacent values of a piece is the same for all the pieces, each piece carrying Q N + P values defining a sequence having a predetermined reading order, and the number of pieces of said set being such that all the combinations of M values taken Q by Q are reproduced once and only once by the sequences carried by all the pieces of said set, according to said predetermined reading order, said pieces being in the form of isosceles triangles, the two equal sides of which each have a length twice that of the third side, each piece having two sites arranged respectively in the center of said equal sides, and in which for M 2, said game comprises 32 pieces, the sequences of which are all different.
Claim 4
Dependent Claim
197 words
A game comprising at least one set of identical pieces with N apices and N sides, values taken from M possible values arranged at each one of the N apices of each piece as well as at each one of the sites P arranged along at least one of the sides of the piece, P being equal to at least one, such that the distance separating any two adjacent values of a piece is the same for all the pieces, each piece carrying Q N + P values defining a sequence having a predetermined reading order, and the number of pieces of said set being such that all the combinations of M values taken Q by Q are reproduced once and only once by the sequences carried by all the pieces of said set, according to said predetermined reading order, said pieces being in the form of isosceles triangles, the two equal sides of which each have a length twice that of the third side, each piece having two sites arranged respectively in the center of said equal sides, and in which for M 2, said game comprises 32 pieces, the sequences of which are all different.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-08-29 | 1976-02-28 | 1976-08-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-08-29 | 1980-02-28 | 1980-08-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-08-29 | 1984-02-28 | 1984-08-29 | $7700.00 | Window Closed / Lapsed |