US20160303470A1

US20160303470A1 - Puzzle Game

Info

Publication number: US20160303470A1
Application number: US15/130,624
Authority: US
Inventors: Brian W. Diamond
Original assignee: Individual
Current assignee: Individual
Priority date: 2015-04-17
Filing date: 2016-04-15
Publication date: 2016-10-20

Abstract

Embodiments of the instant invention are directed to a solvable puzzle game including a matrix having N²unfilled cells arranged in N rows, N columns, and N sub-matrices, whereby each sub-matrix can be formed from N continuous unfilled cells. Each unfilled cell can be fillable with one indicia selected from N discrete indicia to provide a filled cell; and each row, column, and sub-matrix can be fillable with one indicia set which consists of one each of the N discrete indicia. The solvable puzzle game can be solved by providing a minimum number of filled cells which renders each remaining unfilled cell fillable with only one indicia selected from the N discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix can be filled with one indicia set which consists of one each of the N discrete indicia.

Description

This U.S. Non-Provisional Patent Application claims the benefit of U.S. Provisional Patent Application No. 62/149,462, filed Apr. 17, 2015, hereby incorporated by reference herein.

SUMMARY OF THE INVENTION

A broad object of a particular embodiment of the invention can be to provide a solvable puzzle game, and methods of making and using such a solvable puzzle game, whereby the solvable puzzle game includes a matrix having N²unfilled cells arranged in N rows, N columns, and N sub-matrices, whereby each sub-matrix can be formed from N continuous unfilled cells. Each unfilled cell can be fillable with one indicia selected from N discrete indicia to provide a filled cell; and each row, column, and sub-matrix can be fillable with one indicia set which consists of one each of the N discrete indicia.
Another broad object of a particular embodiment of the invention can be to provide a solvable puzzle game which can be solved by providing a minimum number of filled cells which renders each remaining unfilled cell fillable with only one indicia selected from the N discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix can be filled with one indicia set which consists of one each of the N discrete indicia.
Naturally, further objects of the invention are disclosed throughout other areas of the specification, drawings, and claims.

A BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is an illustration of a particular embodiment of a solvable puzzle game having a solution including a minimum number of four filled cells, each filled with one discrete indicia selected from N discrete indicia, whereby N is five.

FIG. 1B is an illustration of the particular embodiment of the solvable puzzle game shown in FIG. 1A, whereby each remaining unfilled cell is filled with only one discrete indicia selected from the five discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix is filled with one indicia set consisting of one each of the five discrete indicia.

FIG. 2A is an illustration of a particular embodiment of a solvable puzzle game having a solution including a minimum number of four filled cells, each filled with one discrete indicia selected from N discrete indicia, whereby N is five.

FIG. 2B is an illustration of the particular embodiment of the solvable puzzle game shown in FIG. 2A, whereby each remaining unfilled cell is filled with only one discrete indicia selected from the five discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix is filled with one indicia set consisting of one each of the five discrete indicia.

FIG. 3A is an illustration of a particular embodiment of a solvable puzzle game which includes a matrix having N²unfilled cells, whereby N is five.

FIG. 3B is an exploded illustration of the particular embodiment of a solvable puzzle game shown in FIG. 3B, whereby the N²unfilled cells are arranged in N rows, and whereby N is five.

FIG. 3C is an exploded illustration of the particular embodiment of a solvable puzzle game shown in FIG. 3A, whereby the N²unfilled cells are arranged in N columns, and whereby N is five.

FIG. 4A is an illustration of a particular embodiment of a solvable puzzle game which includes a matrix having N²unfilled cells arranged in N rows and N columns, and further arranged in N sub-matrices, and whereby N is five.

FIG. 4B is an illustration of a particular embodiment of a solvable puzzle game which includes a matrix having N²unfilled cells arranged in N rows and N columns, and further arranged in N sub-matrices, and whereby N is five.

FIG. 5A is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5B is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5C is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5D is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5E is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5F is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5G is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5H is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5I is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5J is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5K is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 5L is an illustration of a sub-matrix configuration of a sub-matrix formed from N continuous unfilled cells, whereby N is five.

FIG. 6A is an illustration of the sub-matrix configuration shown in FIG. 5B, whereby the sub-matrix configuration is oriented in a first orientation.

FIG. 6B is an illustration of the sub-matrix configuration shown in FIG. 5B, whereby the sub-matrix configuration is oriented in a second orientation.

FIG. 6C is an illustration of the sub-matrix configuration shown in FIG. 5B, whereby the sub-matrix configuration is oriented in a third orientation.

FIG. 6D is an illustration of the sub-matrix configuration shown in FIG. 5B, whereby the sub-matrix configuration is oriented in a fourth orientation.

FIG. 7A is an illustration of the sub-matrix configuration shown in FIG. 5B, whereby the sub-matrix configuration is oriented in a fifth orientation.

FIG. 7B is an illustration of the sub-matrix configuration shown in FIG. 5B, whereby the sub-matrix configuration is oriented in a sixth orientation.

FIG. 8A is an illustration of the sub-matrix configuration shown in FIG. 6A, whereby the sub-matrix is oriented in the first orientation and disposed in a first exemplary position within the matrix.

FIG. 8B is an illustration of the sub-matrix configuration shown in FIG. 6A, whereby the sub-matrix is oriented in the first orientation and disposed in a second exemplary position within the matrix.

FIG. 8C is an illustration of the sub-matrix configuration shown in FIG. 6A, whereby the sub-matrix is oriented in the first orientation and disposed in a third exemplary position within the matrix.

FIG. 9A is an illustration of the sub-matrix configuration shown in FIG. 6A, whereby the sub-matrix is oriented in the first orientation and disposed in a fourth exemplary position within the matrix.

FIG. 9B is an illustration of the sub-matrix configuration shown in FIG. 6A, whereby the sub-matrix is oriented in the first orientation and disposed in a fifth exemplary position within the matrix.

FIG. 10 is an illustration of a particular embodiment of a solvable puzzle game which includes a matrix having N²unfilled cells arranged in N rows and N columns, and further arranged in N sub-matrices, whereby N is five, and whereby the matrix is disposed on a substrate which can be configured as a writing surface.

FIG. 11 is an illustration of a particular embodiment of a solvable puzzle game which includes a matrix having N²unfilled cells arranged in N rows and N columns, and further arranged in N sub-matrices, whereby N is five, whereby the matrix is disposed on a substrate which can received within a sleeve, and whereby the sleeve can provide a reusable writing surface.

FIG. 12 is an illustration of a particular embodiment of a solvable puzzle game which can be configured as a computer-implemented game.

FIG. 13A is an illustration of a particular embodiment of a solvable puzzle game having a solution including a minimum number of three filled cells, each filled with one discrete indicia selected from N discrete indicia, whereby N is four.

FIG. 13B is an illustration of the particular embodiment of the solvable puzzle game shown in FIG. 13A, whereby each remaining unfilled cell is filled with only one discrete indicia selected from the four discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix is filled with one indicia set consisting of one each of the four discrete indicia.

FIG. 14A is an illustration of a particular embodiment of a solvable puzzle game having a solution including a minimum number of three filled cells, each filled with one discrete indicia selected from N discrete indicia, whereby N is four.

FIG. 14B is an illustration of the particular embodiment of the solvable puzzle game shown in FIG. 14A, whereby each remaining unfilled cell is filled with only one discrete indicia selected from the four discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix is filled with one indicia set consisting of one each of the four discrete indicia.

FIG. 15A is an illustration of a particular embodiment of a solvable puzzle game having a solution including a minimum number of three filled cells, each filled with one discrete indicia selected from N discrete indicia, whereby N is four.

FIG. 15B is an illustration of the particular embodiment of the solvable puzzle game shown in FIG. 15A, whereby each remaining unfilled cell is filled with only one discrete indicia selected from the four discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix is filled with one indicia set consisting of one each of the four discrete indicia.

FIG. 16A is an illustration of a particular embodiment of a solvable puzzle game having a solution including a minimum number of four filled cells, each filled with one discrete indicia selected from N discrete indicia, whereby N is four.

FIG. 16B is an illustration of the particular embodiment of the solvable puzzle game shown in FIG. 16A, whereby each remaining unfilled cell is filled with only one discrete indicia selected from the four discrete indicia to satisfy a matrix condition whereby each row, column, and sub-matrix is filled with one indicia set consisting of one each of the four discrete indicia.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Now referring primarily to FIG. 1A through FIG. 2B, which illustrate particular embodiments of a solvable puzzle game (1) having a solution (2) including a minimum number of four filled cells (3) (as shown in the examples of FIG. 1A and FIG. 2A). Upon filling of each of the four filled cells (3) with one indicia (4) selected from N discrete indicia (4), each remaining unfilled cell (5) is fillable with only one indicia (4) selected from the N discrete indicia (4) to satisfy a matrix condition (6) whereby each row (7), column (8), and sub-matrix (9) is filled with one indicia set (10) consisting of one each of the N discrete indicia (4) (as shown in the examples of FIG. 1B and FIG. 2B).
Now referring primarily to FIG. 3A, the solvable puzzle game (1) includes a matrix (11) having N²unfilled cells (5).
The term “matrix” for the purposes of this invention means an arrangement of elements into a pattern of lines and spaces. As a non-limiting example of a matrix (11) having N×N elements, the matrix (11) can be configured as a square arrangement of elements into a pattern of lines and spaces. As to this particular embodiment, each unfilled cell (5) can be defined by a square.
Now referring primarily to FIG. 3B and FIG. 3C, the N²unfilled cells (5) can be arranged in N rows (7) (as shown in the example of FIG. 3B) and N columns (8) (as shown in the example of FIG. 3C). As to particular embodiments, the N rows (7) can be disposed substantially horizontally within the matrix (11) and the N columns (8) can be disposed substantially vertically within the matrix (11).
As but one illustrative example, a particular embodiment of the solvable puzzle game (1) can have an N equal to five (as shown in the examples of FIG. 1A through FIG. 12). Accordingly, the matrix (11) can have twenty-five unfilled cells (5) arranged in five rows (7) and five columns (5). However, the invention need not be so limited, as particular embodiments of the solvable puzzle game (1) can have Ns lesser or greater than five, depending upon the application.
As but a second illustrative example, a particular embodiment of the solvable puzzle game (1) can have an N equal to four (as shown in the examples of FIG. 13A through FIG. 16B). Accordingly, the matrix (11) can have sixteen unfilled cells (5) arranged in four rows (7) and four columns (5). However, the invention need not be so limited, as particular embodiments of the solvable puzzle game (1) can have Ns lesser or greater than four, depending upon the application.
Now referring primarily to FIG. 4A and FIG. 4B, the N²unfilled cells (5) are further arranged in N sub-matrices (9), whereby each sub-matrix (9) is formed from N continuous unfilled cells (5).
The term “continuous” when applied to cells for the purposes of this invention means a configuration of cells whereby each cell within the configuration shares at least one side with an adjacent cell in the configuration.
As to particular embodiments, the N continuous unfilled cells (5) which form each sub-matrix (9) can be visually subdivided within the matrix (11) such that each sub-matrix (9) can be visually distinguished. As but one illustrative example, each sub-matrix (9) can be visually subdivided within the matrix (11) by a distinguishable outline or border (as shown in the examples of the Figures). As but a second illustrative example, each sub-matrix (9) can be visually subdivided within the matrix (11) by a distinguishable fill, such as a fill color or pattern, which differs from the fill of the other sub-matrices (9).
A sub-matrix (9) formed from N continuous unfilled cells (5) can have any of a numerous and wide variety of sub-matrix configurations (12) whereby each unfilled cell (5) within the sub-matrix configuration (12) shares at least one side with an adjacent unfilled cell (5) in the sub-matrix configuration (12).
For example, as to particular embodiments of the solvable puzzle game (1) including N sub-matrices (9), whereby N is five, the five continuous unfilled cells (5) forming each sub-matrix (9) can be configured in one of twelve sub-matrix configurations (12) which are shown in FIG. 5A through FIG. 5L, whereby each unfilled cell (5) within the sub-matrix configuration (12) shares at least one side with an adjacent unfilled cell (5) in the sub-matrix configuration (12).
Within the matrix (11), each of the N sub-matrix configurations (12), corresponding to N sub-matrices (11), can be oriented in one of a first orientation (13); a second orientation (14), which is generated by a 90 degree clockwise rotation of the first orientation (13); a third orientation (15), which is generated by a 90 degree clockwise rotation of the second orientation (14); and a fourth orientation (16), which is generated by a 90 degree clockwise rotation of the third orientation (15) (as shown respectively in FIG. 6A through FIG. 6D for the sub-matrix configuration (12) shown in FIG. 5B).
Further, within the matrix (11), each of the N sub-matrix configurations (12), corresponding to N sub-matrices (11), can be oriented in one of a fifth orientation (26), which is generated by a reflection of the first orientation (13) about a vertical axis; and a sixth orientation (27), which is generated by a reflection of the first orientation (13) about a horizontal axis (as shown respectively in FIG. 7A and FIG. 7B for the sub-matrix configuration (12) shown in FIG. 5B).
Still further, within the matrix (11), each of the N sub-matrix configurations (12), corresponding to N sub-matrices (11), can be disposed in any of a numerous and wide variety of positions within the matrix (11), provided that the position of each sub-matrix configuration (12) allows the other N-1 sub-matrix configurations (12) to fit within the matrix (11).
As an illustrative example, the sub-matrix configuration (12) shown in FIG. 5B and oriented in the first orientation (13) (as shown in FIG. 6A), can be disposed in any one of the positions shown in FIG. 8A through FIG. 8C (as well as additional positions). In FIG. 8A, the sub-matrix configuration (12) shown in FIG. 5B and oriented in the first orientation (13) is disposed in a first exemplary position (17), occupying cells A1, A2, B2, B3, and C2 of the matrix (11). In FIG. 8B, the sub-matrix configuration (12) shown in FIG. 5B and oriented in the first orientation (13) is disposed in a second exemplary position (18), occupying cells B2, B3, C3, C4, and D3 of the matrix (11). In FIG. 8C, the sub-matrix configuration (12) shown in FIG. 5B and oriented in the first orientation (13) is disposed in a third exemplary position (19), occupying cells C3, C4, D4, D5, and E4 of the matrix (11).
Now referring primarily to FIG. 1A through FIG. 2B, each unfilled cell (5) within the matrix (11) having N²unfilled cells (5) is fillable with one indicia (4) selected from N discrete indicia (4) to provide a filled cell (3). The indicia (4) can be any of a numerous and wide variety of indicia (4) provided that each indicia (4) is discrete from the other N-1 indicia (4). As an illustrative example, each of the N discrete indicia (4), whereby N is five, can be a character configured as number, for example: 1, 2, 3, 4, and 5 (as shown in the example of FIG. 1A and FIG. 1B). As another illustrative example, each of the N discrete indicia (4), whereby N is five, can be a character configured as a letter of an alphabet, such as the English alphabet, for example: A, B, C, D, and E (as shown in the example of FIG. 2A and FIG. 2B) or a, b, c, d, and e. However, the invention need not be so limited, as particular embodiments of the solvable puzzle game (1) can include indicia (4) having any configuration, depending upon the application.
Again referring primarily to FIG. 1A through FIG. 2B, each row (7), column (8), and sub-matrix (9) within the matrix (11) having N²unfilled cells (5) is fillable with one indicia set (10) which consists of one each of the N discrete indicia (4). The N discrete indicia (4) which comprise the indicia set (10) can be any of a numerous and wide variety of indicia (4) provided that each indicia (4) is discrete from the other N-1 indicia (4). As an illustrative example, the indicia set (10) which consists of one each of the N discrete indicia (4), whereby N is five, can be a set of characters, each configured as number, for example: 1, 2, 3, 4, and 5 (as shown in the example of FIG. 1A and FIG. 1B). As another illustrative example, the indicia set (10) which consists of one each of the N discrete indicia (4), whereby N is five, can be a set of characters, each configured as a letter of the English alphabet, for example: A, B, C, D, and E (as shown in the example of FIG. 2A and FIG. 2B) or a, b, c, d, and e. However, the invention need not be so limited, as particular embodiments of the solvable puzzle game (1) can include indicia sets (10) consisting of indicia (4) having any configuration, depending upon the application.
Again referring primarily to FIG. 1A through FIG. 2B, as to particular embodiments, the solvable puzzle game (1) can be solved by providing a minimum number of filled cells (3) which renders each remaining unfilled cell (5) finable with only one indicia (4) selected from the N discrete indicia (4) to satisfy a matrix condition (6) wherein each row (7), column (8), and sub-matrix (9) is filled with one indicia set (10) which consists of one each of the N discrete indicia (4).
Now referring primarily to FIG. 1A and FIG. 1B, a particular embodiment of the solvable puzzle game (1) can include a matrix (11) having N²unfilled cells (5), whereby N is five, and each unfilled cell (5) is fillable with one indicia (4) selected from “1”, “2”, “3”, “4”, and “5”. As to particular embodiments, the solvable puzzle game (1) can have a solution (2) including a minimum number of four filled cells (3), whereby a first cell (20) of the four filled cells (3) can be cell A3 and can be filled with a “1”; a second cell (21) of the four filled cells (3) can be cell C5 and can be filled with a “4”; a third cell (22) of the four filled cells (3) can be cell D4 and can be filled with a “2”; and a fourth cell (23) of the four filled cells (3) can be cell E2 and can be filled with a “3” (as shown in the example of FIG. 1A). Upon filling of each of the first, second, third, and fourth cells (20)(21)(22)(23) with one indicia (4) selected from the five discrete indicia (4), each remaining unfilled cell (5) is fillable with only one discrete indicia (4) selected from the five discrete indicia (4) to satisfy a matrix condition (6) whereby each of the five rows (7), five columns (8), and five sub-matrices (9) are filled with one indicia set (10) consisting of one each of the five discrete indicia (4) (as shown in the example of FIG. 1B). Accordingly, each of the five rows (7), five columns (8), and five sub-matrices (9) are filled with one indicia set (10) consisting of one each of “1”, “2”, “3”, “4”, and “5”.
Now referring primarily to FIG. 2A and FIG. 2B, another particular embodiment of the solvable puzzle game (1) can include a matrix (11) having N²unfilled cells (5), whereby N is five, and each unfilled cell (5) is fillable with one indicia (4) selected from “A”, “B”, “C”, “D”, and “E”. As to particular embodiments, the solvable puzzle game (1) can have a solution (2) including a minimum number of four filled cells (3), whereby a first cell (20) of the four filled cells (3) can be cell A1 and can be filled with an “A”; a second cell (21) of the four filled cells (3) can be cell B2 and can be filled with a “C”; a third cell (22) of the four filled cells (3) can be cell D5 and can be filled with a “B”; and a fourth cell (23) of the four filled cells (3) can be cell E4 and can be filled with a “D” (as shown in the example of FIG. 2A). Upon filling of each of the first, second, third, and fourth cells (20)(21)(22)(23) with one indicia (4) selected from the five discrete indicia (4), each remaining unfilled cell (5) is fillable with only one discrete indicia (4) selected from the five discrete indicia (4) to satisfy a matrix condition (6) whereby each of the five rows (7), five columns (8), and five sub-matrices (9) are filled with one indicia set (10) consisting of one each of the five discrete indicia 40 (as shown in the example of FIG. 2B). Accordingly, each of the five rows (7), five columns (8), and five sub-matrices (9) are filled with one indicia set (10) consisting of one each of “A”, “B”, “C”, “D”, and “E”.
Although the two exemplary solvable puzzle games (1), each including a matrix (11) having N²unfilled cells (5) whereby N is five, shown in FIG. 1A through FIG. 2B have solutions (2) which include a minimum number of N-1 filled cells (3), the minimum number of filled cells (3) which can be provided to solve a particular embodiment of the solvable puzzle game (1) need not necessarily be N-1. For example, a particular embodiment of the solvable puzzle game (1) can be solved by providing a minimum number of N, N+1, N+2, and so on, filled cells (3).
As to particular embodiments, the solvable puzzle game (1) may not be deemed solved when a minimum number of filled cells (3) is provided which renders at least one remaining unfilled cell (5) fillable with more than one indicia (4) selected from the N discrete indicia (4) to satisfy the matrix condition (6) whereby each row (7), column (8), and sub-matrix (9) is filled with one indicia set (10) which consists of one each of the N discrete indicia (4).
Now referring primarily to FIG. 9A and FIG. 9B, as to another particular embodiment of the solvable puzzle game (1) contemplated herein, each sub-matrix (9) can be formed from N continuous unfilled cells (5), whereby the definition of continuous unfilled cells (5) can be expanded to include unfilled cells (5) which wrap or extend around a row (7) or unfilled cells (5) which wrap or extend around a column (8).
Now referring primarily to FIG. 9A, the sub-matrix configuration (12) shown in FIG. 5B and oriented in the first orientation (13) can be disposed in a fourth exemplary position (24), which can be generated by moving the sub-matrix configuration (12) from the first exemplary position (17) shown in FIG. 8A leftward by one column (8) so that one of the five continuous unfilled cells (5) wraps or extends around row A to now occupy cell AS of the matrix (11).
Now referring primarily to FIG. 9B, the sub-matrix configuration (12) shown in FIG. 5B and oriented in the first orientation (13) can be disposed in a fifth exemplary position (25), which can be generated by moving the sub-matrix configuration (12) from the first exemplary position (17) shown in FIG. 8A upward by one row (7) so that two of the five continuous unfilled cells (5) wrap or extend around columns 1 and 2 to now occupy cells El and E2 of the matrix (11).
Now referring primarily to FIG. 10, as to particular embodiments, the solvable puzzle game (1) can, but need not necessarily, further includes a substrate (28) on which the matrix (11) can be disposed. As but one illustrative example, the substrate (28) can be configured as a writing surface (29) on which a player of the solvable puzzle game (1) can write with a writing instrument (30) to fill the unfilled cells (5).
As to particular embodiments, the writing surface (29) can be a reusable writing surface (29), which can be used a plurality of times, for example with a writing instrument (30) that provides erasable writing.
As but s first illustrative, the writing surface (29) can be made from paper or paper-like material and the writing instrument (30) can be a pencil which provides erasable writing.
As but a second illustrative example, the writing surface (29) can be made from plastic or plastic-like material and the writing instrument (30) can be a pen or marker which provides erasable writing.
Now referring primarily to FIG. 11, as to particular embodiments, the solvable puzzle game (1) can, but need not necessarily, further include a sleeve (31) in which the substrate (28) can be received, whereby the sleeve (31) can provide the reusable writing surface (29). Accordingly, the sleeve (31) can be made from a transparent or substantially transparent material, such as plastic or plastic-like material.
As to particular embodiments, the solvable puzzle game (1) can, but need not necessarily, further include a set of rules which specify constraints regarding placement of the indicia (4) within the unfilled cells (5).
As to particular embodiments, the solvable puzzle game (1) can, but need not necessarily, further include one or more hints which may be useful for solving the solvable puzzle game (1).
As to particular embodiments, the solvable puzzle game (1) can, but need not necessarily, further include a solution to the solvable puzzle game (1).
Now referring primarily to FIG. 12, as to particular embodiments, the solvable puzzle game (1) can be a computer-implemented game (32) and correspondingly, can be configured for implementation on an electronic device (33), such as a computer (34).
Again referring primarily to FIG. 12, the solvable puzzle game (1) can be provided as program code (35) which is executable by a processor (36) of a computer (34), whereby a computer (34) can be any device having a controller (37) or a microcontroller (37) which may include at least one processor (36) which operatively controls the function of one or more programs (38) stored as program code (35) in a memory element (39), whereby the program (38) facilitates playing the solvable puzzle game (1) on the electronic device (33). As non-limiting examples, an electronic device (33) or a computer (34) can include: a conventional computer, such as a desktop computer or a laptop computer; a smartphone; a cell phone; a pad device; a slate device; a tablet device; or the like.
Again referring primarily to FIG. 12, as to particular embodiments, the matrix (11) of the solvable puzzle game (1) can be provided on a display surface (40), such as a screen (41), of the electronic device (33), whereby a player can provide input into the electronic device (33) to filled the unfilled cells (5) displayed on the display surface (40) and correspondingly, to solve the solvable puzzle game (1).
A method of making a solvable puzzle game (1) can include providing a matrix (11) having N²unfilled cells (5) arranged in N rows (7), N columns (8), and N sub-matrices (9), whereby each sub-matrix (9) can be formed from N continuous unfilled cells (5). Each unfilled cell (5) is fillable with one indicia (4) selected from N discrete indicia (4) to provide a filled cell (3), and each row (7), column (8), and sub-matrix (9) is fillable with one indicia set (10) consisting of one each of the N discrete indicia (4).
The method of making the solvable puzzle game (1) can, but need not necessarily, further include providing additional components of the solvable puzzle game (1), as described above.
A method of using the solvable puzzle game (1) can include obtaining a matrix (11) having N²unfilled cells (5) arranged in N rows (7), N columns (8), and N sub-matrices (9), whereby each sub-matrix (9) can be formed from N continuous unfilled cells (5); each unfilled cell (5) fillable with one indicia (4) selected from N discrete indicia (4) to provide a filled cell (3); each row (7), column (8), and sub-matrix (9) fillable with one indicia set (10) which consists of one each of the N discrete indicia (4); and solving the solvable puzzle game (1) by providing a minimum number of filled cells (3) which renders each remaining unfilled cell (5) fillable with only one indicia (4) selected from the N discrete indicia (4) to satisfy a matrix condition (6) whereby each row (7), column (8), and sub-matrix (9) can be filled with one indicia set (10) which consists of one each of the N discrete indicia (4).
As can be easily understood from the foregoing, the basic concepts of the present invention may be embodied in a variety of ways. The invention involves numerous and varied embodiments of a puzzle game and methods for making and using such a puzzle game, including the best mode.
As such, the particular embodiments or elements of the invention disclosed by the description or shown in the figures or tables accompanying this application are not intended to be limiting, but rather exemplary of the numerous and varied embodiments generically encompassed by the invention or equivalents encompassed with respect to any particular element thereof. In addition, the specific description of a single embodiment or element of the invention may not explicitly describe all embodiments or elements possible; many alternatives are implicitly disclosed by the description and figures.
It should be understood that each element of an apparatus or each step of a method may be described by an apparatus term or method term. Such terms can be substituted where desired to make explicit the implicitly broad coverage to which this invention is entitled. As but one example, it should be understood that all steps of a method may be disclosed as an action, a means for taking that action, or as an element which causes that action. Similarly, each element of an apparatus may be disclosed as the physical element or the action which that physical element facilitates. As but one example, the disclosure of a “solution” should be understood to encompass disclosure of the act of “solving”—whether explicitly discussed or not—and, conversely, were there effectively disclosure of the act of “solving”, such a disclosure should be understood to encompass disclosure of a “solution” and even a “means for solving”. Such alternative terms for each element or step are to be understood to be explicitly included in the description.
In addition, as to each term used it should be understood that unless its utilization in this application is inconsistent with such interpretation, common dictionary definitions should be understood to be included in the description for each term as contained in the Random House Webster's Unabridged Dictionary, second edition, each definition hereby incorporated by reference.
All numeric values herein are assumed to be modified by the term “about”, whether or not explicitly indicated. For the purposes of the present invention, ranges may be expressed as from “about” one particular value to “about” another particular value. When such a range is expressed, another embodiment includes from the one particular value to the other particular value. The recitation of numerical ranges by endpoints includes all the numeric values subsumed within that range. A numerical range of one to five includes for example the numeric values 1, 1.5, 2, 2.75, 3, 3.80, 4, 5, and so forth. It will be further understood that the endpoints of each of the ranges are significant both in relation to the other endpoint, and independently of the other endpoint. When a value is expressed as an approximation by use of the antecedent “about,” it will be understood that the particular value forms another embodiment. The term “about” generally refers to a range of numeric values that one of skill in the art would consider equivalent to the recited numeric value or having the same function or result. Similarly, the antecedent “substantially” means largely, but not wholly, the same form, manner or degree and the particular element will have a range of configurations as a person of ordinary skill in the art would consider as having the same function or result. When a particular element is expressed as an approximation by use of the antecedent “substantially,” it will be understood that the particular element forms another embodiment.
Moreover, for the purposes of the present invention, the term “a” or “an” entity refers to one or more of that entity unless otherwise limited. As such, the terms “a” or “an”, “one or more” and “at least one” can be used interchangeably herein.
Thus, the applicant(s) should be understood to claim at least: i) each of the puzzle games herein disclosed and described, ii) the related methods disclosed and described, iii) similar, equivalent, and even implicit variations of each of these devices and methods, iv) those alternative embodiments which accomplish each of the functions shown, disclosed, or described, v) those alternative designs and methods which accomplish each of the functions shown as are implicit to accomplish that which is disclosed and described, vi) each feature, component, and step shown as separate and independent inventions, vii) the applications enhanced by the various systems or components disclosed, viii) the resulting products produced by such systems or components, ix) methods and apparatuses substantially as described hereinbefore and with reference to any of the accompanying examples, x) the various combinations and permutations of each of the previous elements disclosed.
The background section of this patent application, if any, provides a statement of the field of endeavor to which the invention pertains. This section may also incorporate or contain paraphrasing of certain U.S. patents, patent applications, publications, or subject matter of the claimed invention useful in relating information, problems, or concerns about the state of technology to which the invention is drawn toward. It is not intended that any U.S. patent, patent application, publication, statement or other information cited or incorporated herein be interpreted, construed or deemed to be admitted as prior art with respect to the invention.
The claims set forth in this specification, if any, are hereby incorporated by reference as part of this description of the invention, and the applicant expressly reserves the right to use all of or a portion of such incorporated content of such claims as additional description to support any of or all of the claims or any element or component thereof, and the applicant further expressly reserves the right to move any portion of or all of the incorporated content of such claims or any element or component thereof from the description into the claims or vice-versa as necessary to define the matter for which protection is sought by this application or by any subsequent application or continuation, division, or continuation-in-part application thereof, or to obtain any benefit of, reduction in fees pursuant to, or to comply with the patent laws, rules, or regulations of any country or treaty, and such content incorporated by reference shall survive during the entire pendency of this application including any subsequent continuation, division, or continuation-in-part application thereof or any reissue or extension thereon.
Additionally, the claims set forth in this specification, if any, are further intended to describe the metes and bounds of a limited number of the preferred embodiments of the invention and are not to be construed as the broadest embodiment of the invention or a complete listing of embodiments of the invention that may be claimed. The applicant does not waive any right to develop further claims based upon the description set forth above as a part of any continuation, division, or continuation-in-part, or similar application.

Claims

1. A solvable puzzle game comprising:

a matrix having N²unfilled cells arranged in N rows, N columns, and N sub-matrices, each said sub-matrix formed from N continuous unfilled cells;

each said unfilled cell fillable with one indicia selected from N discrete indicia to provide a filled cell;

each said row, said column, and said sub-matrix fillable with one indicia set which consists of one each of said N discrete indicia.

2. The solvable puzzle game of claim 1, wherein said solvable puzzle game is solved by providing a minimum number of filled cells which renders each remaining said unfilled cell fillable with only one said indicia selected from said N discrete indicia to satisfy a matrix condition wherein each said row, said column, and said sub-matrix is filled with said one indicia set which consists of one each of said N discrete indicia.

3-5. (canceled)

6. The solvable puzzle game of claim 2, wherein N is five.

7. The solvable puzzle game of claim 2, wherein N is less than five.

8. The solvable puzzle game of claim 2, wherein N is greater than five.

9. (canceled)

10. The solvable puzzle game of claim 2, wherein said indicia comprise numbers.

11. The solvable puzzle game of claim 2, wherein said indicia comprise letters.

12-17. (canceled)

18. The solvable puzzle game of claim 2, wherein at least one said sub-matrix is formed from said N continuous unfilled cells which wrap around said row or said column.

19. The solvable puzzle game of claim 2, further comprising a substrate on which said matrix is disposed.

20. The solvable puzzle game of claim 19, wherein said substrate comprises a writing surface.

21. The solvable puzzle game of claim 20, wherein said writing surface is configured as a reusable writing surface.

22. The solvable puzzle game of claim 21, further comprising a writing instrument for use with said reusable writing surface, wherein said writing instrument provides erasable writing.

23. The solvable puzzle game of claim 19, further comprising a sleeve in which said substrate can be received, said sleeve providing a reusable writing surface.

24. The solvable puzzle game of claim 23, wherein said sleeve is formed from a substantially transparent material.

25. The solvable puzzle game of claim 2, further comprising a set of rules which specify constraints regarding placement of said indicia within said unfilled cells.

26. The solvable puzzle game of claim 2, further comprising one or more hints which may be useful for solving said solvable puzzle game.

27. The solvable puzzle game of claim 2, further comprising a solution to said solvable puzzle game.

28. The solvable puzzle game of claim 2, wherein said solvable puzzle game is a computer-implemented game.

29. The solvable puzzle game of claim 28, wherein said solvable puzzle game is provided as program code which is executable by a processor of a computer.

30. The solvable puzzle game of claim 29, wherein said computer comprises a device selected from the group consisting of: a desktop computer, a laptop computer, a smartphone, a cell phone, a pad device, a slate device, and a tablet device.

31-61. (canceled)