# US 2021/0197070 A1 · Systems and methods to enhance and develop new games and activities based on logic puzzles

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0197070 A1
- Document ID: US20210197070A1
- Status: Published application
- Kind: A1
- Application number: 17/168,139
- Filed: 2021-02-04
- Published: 2021-07-01
- Earliest claimed: 2013-03-15
- Inventors: Indu M. Anand; Ishan Anand; Pranav Anand
- Web page: https://patentgrep.com/patent/US20210197070A1

## CPC

- A63F 3/0421: {Electric word or number games}
- A63F 13/33: using wide area network [WAN] connections
- A63F 3/0415: {Number games (electric A63F3/0421; mathematical models or topics A63F3/0457; two-dimensional puzzles with rotating rings or discs A63F9/0811, A63F9/0819)}
- A63F 13/46: Computing the game score
- A63F 13/5375: for graphically or textually suggesting an action, e.g. by displaying an arrow indicating a turn in a driving game
- A63F 13/798: for assessing skills or for ranking players, e.g. for generating a hall of fame
- A63F 2003/0418: {with a grid, e.g. 'Sudoku'-type games}
- A63F 2300/305: for providing a graphical or textual hint to the player
- A63F: CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR

## Abstract

Methods and apparatus of associating by a computerized system, labels with the order of execution of steps of solving a puzzle, game or activity, for one or more parts of one or more solution-paths for the puzzle, game or activity are described. Execution of the puzzle solution and also the particular sequence of steps in the solution paths are used to evaluate a relative efficiency of one sequence of steps over the other sequence. By quantifying efficiency of the solution path it becomes possible to logically and objectively compare the efficiency of two or more solutions or completions of the puzzle, game or activity.

## Claims

### Claim 1

A method of associating by a computerized system, labels with the order of execution of steps of solving a puzzle, for one or more parts of one or more solution-paths for the puzzle, wherein,
the computerized system includes at least one computing device or a network of computing devices,
the puzzle has a given configuration of a set of spaces, a given set of distinct characters, and a given set of rules,
the set of spaces includes one or more empty spaces, a space being non-empty if it has a character filled in it;
a step of solving the puzzle comprises filling an empty space of the one or more empty spaces with a character selected from the given set of distinct characters, consistent with the given set of rules and the given one or more non-empty spaces in the set of spaces when the set of spaces includes one or more non-empty spaces;
the puzzle is solved by one or more steps of filling the one or more empty spaces in the set of spaces;
a solution to the puzzle is complete when all of the one or more empty spaces in the set of spaces are filled by steps of solving the puzzle;
a path to the solution, or solution-path, is a chain of two or more steps of solving the puzzle which are linked in the same sequential order in which the corresponding two or more empty spaces of the one or more empty spaces are filled;
a first step of a solution-path has no prior step, and at the first step of the solution-path, an empty space of the one or more empty spaces is filled with a character from the given set of distinct characters based on the given set of rules and the given one or more non-empty spaces in the set of spaces;
a second or subsequent step of the solution-path comprises filling an empty space of the one or more empty spaces with a character from the given set of distinct characters based on the given rules, the given one or more non-empty spaces in the set of spaces and a character filled in an empty space of the one or more empty spaces during one or more prior steps of the solution path; and,
the method of associating the labels for parts of one or more solution-paths comprises the following actions:
(a) providing a sequence of labels, {Label(1), Label(2), . . . , Label(I), . . . } with a known sequential order;
(b) receiving a labeling algorithm for associating the labels with the filling of empty spaces in a solution-path, where Label(1) is associated with the first step of the solution-path, and each empty space filled at a second or subsequent step of the solution path is associated with a label based on the known sequential order of labels in the sequence of labels;
(c) receiving into the computerized system, a first step of a first solution-path;
(d) receiving into the computerized system, an association of Label(1) with the empty space filled at the first step of the first solution-path;
(e) recording the association of Label(1) with the empty space filled at said first step of the first solution-path;
(f) receiving into the computerized system a next step in the first solution-path when said next step exists;
(g) receiving an association by said labeling algorithm of a label with the empty space filled at said next step;
(h) recording into the computerized system, the label associated with the empty space filled at said next step;
(i) receiving into the computerized system a first step of a next solution-path when said next solution-path exists;
(j) receiving into the computerized system an association of Label(1) with the empty space filled at said first step of said next solution-path;
(k) receiving into the computerized system, a next step in said next solution-path when said next step exists;
(l) receiving an association by the labeling algorithm of a label with the empty space filled at said next step in said next solution-path;
(m) recording into the computerized system the label associated with the empty space filled at said next step in said next solution-path;
(n) determining by the computerized system if a label associated with filling a given empty space for any of said one or more solution-paths is inconsistent with a rule in the given set of rules, a given non-empty space in the set of spaces or an empty space filled at any prior step of the solution-path;
(o) identifying by the computerized system from said one or more solution-paths, a first subset of the set of solution-paths for which no label associated with the filling of an empty space is inconsistent with a rule in the given set of rules, a given non-empty space of the set of spaces or an empty space filled at a prior step of the solution-path;
(p) identifying by the computerized system from said one or more solution-paths, a second subset, of the set of solution-paths for which at least one label associated with the filling of an empty space is inconsistent with a rule in the given set of rules, a given non-empty space of the set of spaces or an empty space filled at a prior step of the solution-path;
(q) recording in a first database, each solution-path in the first subset and the labels associated with the filling of the empty spaces;
(r) recording in a second database, each solution-path in said second subset along with the labels associated with the filling of its empty spaces.

### Claim 2 (depends on 1)

The method of claim 1, wherein,
said given set of distinct characters is {Char(1), Char(2), . . . , Char(I), . . . Char(λ)}, collectively identified as {CHARS},
said set of spaces is {Space(1), Space(2), . . . , Space(I), . . . Space(σ)}, collectively identified as {SPACES};
the set of rules, including the given set of rules and the logical constraints for associating labels with the filling of empty spaces of the puzzle, is {Rule(1), Rule(2), . . . , Rule(I), . . . Rule(ρ)}, collectively identified as {RULES}; and
filling of Space(K) with a character Char(J) for integers J and K, for 1≤J≤λ, and 1≤K≤σ is associated with the sequence of labels so that:
Label(1) is associated with filling Space(K) with a character, Char(J), if the filling is not inconsistent with {Rules} or with any given non-empty space in {SPACES};
Label(I) is associated with the filling of Space(K) by character Char(J), if the filling is not inconsistent with: a Rule in the set {RULES}, or a given non-empty space in {SPACES}, or the association of labels, Label(1), Label(2), . . . , Label(I−1) with the filling of characters from {CHARS} into spaces other than Space(K).

### Claim 3 (depends on 1)

The method of claim 1, comprising the following additional steps:
(s) reviewing, for a solution-path in said second database, the labels associated with the steps of solving the puzzle, sequentially starting with the first label determined to be inconsistent with a rule in the given set of rules, a given non-empty space in the set of spaces or an empty space filled at any prior step of the solution-path;
(t) replacing said first inconsistent label to remove the inconsistency;
(u) replacing labels for subsequent steps of solving the puzzle as a result of said replacing of the inconsistent label;
(v) determining by the computerized system if the new labels associated with filling of given empty spaces for the solution-path as a result of the replacing are inconsistent with a rule in the given set of rules, a given non-empty space in the set of spaces or an empty space filled at any prior step of the solution-path;
(w) repeating steps (s), (t), (u) and (v) if, after the replacing, a label associated with the filling of subsequent spaces in the solution-path is inconsistent with a rule in the given set of rules, a given non-empty space in the set of spaces or an empty space filled at any prior step of the solution-path;
(x) moving the solution-path from said second database to said first database.

### Claim 4 (depends on 1)

The method of claim 1, wherein said receiving an association by the labeling algorithm of a label with the empty space filled at said next step comprises the following acts:
(g1) finding by the computer system the place in the sequential order in which the empty space is filled by the provider of the solution-path;
(g2) furnishing by the computer system to said provider, the order in which the empty spaces in the solution-path are filled;
(g3) recording by the computer system of the order in which empty spaces in the solution-path are filled.

### Claim 5 (depends on 4)

The method of claim 4, wherein said keeping the record by the computer system comprises the following acts:
(g31) prompting by the computer system said provider of the solution-path to communicate logical reason or reasons, rooted in the rules, constraints and data, either given or logically derived from the given data sets of information, for filling the empty space with a specific character and associating the label with the filling of the empty space;
(g32) receiving by the computer system of said logical reason or reasons;
(g33) recording by the computer system of the data for uniquely identifying and filling of the empty space, including, the specific character filled, identification of the position in the sequential order at which the empty space is filled in the path, the label associated with the filling, and the logical reason or reasons.

### Claim 6 (depends on 1)

The method of claim 1, wherein said determining by a computer if a label associated with a given empty space is inconsistent with a rule in the given set of rules, a given non-empty space in the set of spaces or an empty space filled at any prior step of the solution-path, comprises the following acts:
(n1) tentatively filling the empty space with each character in said given set of distinct characters, one by one, as a trial to solve the puzzle;
(n2) for each trial to solve the puzzle that results in a failed trial in which a solution to the puzzle is not complete, counting the number of steps from the filling of the empty space with the character to a logical error;
(n3) saving, for each of the failed trials, the minimum number of steps to the logical error;
(n4) verifying that the empty space is filled with the only character from said given set of distinct characters that does not end in a logical error;
(n5) verifying that the label associated with the step of filling the empty space follows in the sequence of labels, distant by more than said minimum numbers for all of the failed trials.

### Claim 7 (depends on 1)

The method of claim 1 for calculating a numerical value for a set of labels associated with filling given empty spaces in a solution-path, comprising the following steps:
(s) providing a sequence of ordered numerical values;
(t) assigning a value from the said sequence of numerical values to each label in the sequence of labels while maintaining correspondence of order between the sequence of values and the sequence of labels;
(u) receiving a formula for computing aggregated value from the numerical values assigned to labels in the set of labels;
(v) computing aggregated value for the set of labels by said formula.

### Claim 8 (depends on 7)

The method of claim 7 for ranking by numerical value two or more sets of labels associated with filling given empty spaces in one or more solution-paths, comprising the following additional steps:
(w) receiving the numerical values assigned to each label in the two or more sets of labels associated with filling the empty spaces in each of said one or more solution-paths;
(x) computing the aggregated values of each of the two or more sets of labels by said formula; and
(y) ranking said two or more sets of labels in the order induced by a comparison of the aggregated values for the sets of labels.

### Claim 9 (depends on 7)

The method of claim 7, comprising the following additional acts for ranking by comparison two or more parts of one or more solution-paths in said first database:
(w) receiving labels associated with the spaces in each of said two or more parts of the solution-paths;
(x) receiving the numerical values assigned to the labels associated with the spaces in each of said two or more parts of the solution-paths;
(y) computing the aggregated values of labels for each of said two or more parts by said formula; and
(z) ranking said two or more parts of the one or more solution-paths in the order induced by a comparison of said aggregated values for each of said two or more parts.

### Claim 10 (depends on 7)

The method of claim 7, comprising the following additional acts for numerically ranking by comparison one or more of the solution-paths in the first database over two or more segments of the given set of spaces:
(w) receiving labels associated with each of the two or more segments of the given set of spaces for one or more of the solution-paths in the first database;
(x) receiving the numerical values assigned to the labels associated with the spaces in each of said two or more segments of the given set of spaces;
(y) computing aggregated values for each of said two or more segments by the formula; and
(z) ranking said two or more parts of the one or more solution-paths in the order induced by a comparison of said aggregated values for each of said two or more segments.

### Claim 11 (depends on 1)

The method of claim 1, comprising the following further steps to generate dynamic hints for a player based on a previous solution available in said first database:
(s) receiving from the player location of the current space or an empty space to fill;
(t) receiving from the player a parameter or parameters to define the bounds of spaces in the given set in which to locate next hint;
(u) providing to the player based on previous solution as next hint, either the location of a space to fill within the bounds defined by player or the location of at least one empty space which when filled would provide a solution-path to a space within the bounds.

### Claim 12 (depends on 1)

The method of claim 1, comprising the following further steps to generate dynamic hints for a new player based on a solution or solutions available in said first database:
(s) receiving from the new player preference for the pace at which to receive hints;
(t) receiving from the new player preference for localization range within the puzzle to receive hints to fill all the spaces;
(u) receiving from the new player location of the empty space to filled;
(v) generating hints for a new player to solve the puzzle or go to a new solution-path using the synthesized merged labels in accordance with the preferences set by the new player.

### Claim 13 (depends on 1)

The method of claim 1 wherein a solution-path is a path for completed solution of the puzzle.
