REAL-TIME STORY GENERATION

• US 20120030249A1
• Filed: 08/02/2010
• Published: 02/02/2012
• Est. Priority Date: 08/02/2010
• Status: Active Grant

• Current Assignee: Disney Enterprises Incorporated (The Walt Disney Company)
• Original Assignee: Disney Enterprises Incorporated (The Walt Disney Company)
• Inventors: Schrag, Nicholas D., Curry, Patrick M., Dunn, Elliot F.
• Granted Patent: US 8,473,445 B2
• Time in Patent Office: Days
• US Class Current: 707/803
• CPC Class Codes: A63F 13/63 by the player, e.g. authoring using a level editor
• CPC Class Codes: A63F 13/822 Strategy games; Role-playing games A63F13/825, A63F13/828 take precedence
• CPC Class Codes: A63F 2300/807 Role playing or strategy games

Abstract

Systems, methods and computer-readable media are disclosed for providing a framework for generating problem situations in a computer game. In one embodiment, the framework includes a data structure representing solution candidates, fact patterns, and a solution designator. The data structure also includes a chain of inference between the solution designator and each candidate. The computer game may generate a problem situation from the data structure and present the problem situation to a user playing the computer game.

Claims

1. A computer-implemented method, comprising:

providing a framework for generating a plurality of problem situations in a computer game, wherein the framework comprises a data structure representing;

(i) a plurality of candidates associated with the plurality of problem situations, (ii) a plurality of fact patterns associated with the plurality of candidates, and (iii) a designation of at least one of the plurality of candidates as a solution to a problem situation of the plurality of problem situations;

wherein each of the plurality of fact patterns includes at least one property used for determining an association in the data structure, wherein the data structure comprises a chain of inference between the designation and each candidate of the plurality of candidates, wherein each chain of inference comprises at least one of the plurality of fact patterns; and

generating, from the data structure and by operation of one or more computer processors, a representation of the problem situation by determining a subset of the plurality of fact patterns of the data structure to include in the representation of the problem situation, wherein the representation of the problem situation comprises the chain of inference between the designation and a candidate of the plurality of candidates, whereby the chain of inference designates the candidate as at least part of the solution to the problem situation in the computer game.

2. The computer-implemented method of claim 1, further comprising:

receiving user input specifying at least one of;

(i) a candidate of the plurality of candidates and (ii) a fact pattern of the plurality of fact patterns.

3. The computer-implemented method of claim 1, wherein at least one of the plurality of fact patterns comprises one of an object and a statement made by one of the plurality of candidates.

4. The computer-implemented method of claim 3, wherein the statement made by one of the plurality of candidates links another candidate of the plurality of candidates to at least one of the object and the designation.

5. The computer-implemented method of claim 1, wherein the association in the data structure is further determined based on a taxonomy comprising at least one noun label representing an object and at least one adjective label representing a trait of a candidate.

6. The computer-implemented method of claim 1, wherein each candidate of the plurality of candidates is uniquely identified using a plurality of traits that characterize a physical appearance of the respective candidate.

7. The computer-implemented method of claim 1, wherein the data structure comprises a graph, and wherein the plurality of candidates, the plurality of fact patterns, and the designation are represented as nodes in the graph.

8. A computer-readable storage medium containing a program which, when executed, performs an operation comprising:

providing a framework for generating a plurality of problem situations in a computer game, wherein the framework comprises a data structure representing;

(i) a plurality of candidates associated with the plurality of problem situations, (ii) a plurality of fact patterns associated with the plurality of candidates, and (iii) a designation of at least one of the plurality of candidates as a solution to a problem situation of the plurality of problem situations;

wherein each of the plurality of fact patterns includes at least one property used for determining an association in the data structure, wherein the data structure comprises a chain of inference between the designation and each candidate of the plurality of candidates, wherein each chain of inference comprises at least one of the plurality of fact patterns; and

generating, from the data structure, a representation of the problem situation by determining a subset of the plurality of fact patterns of the data structure to include in the representation of the problem situation, wherein the representation of the problem situation comprises the chain of inference between the designation and a candidate of the plurality of candidates, whereby the chain of inference designates the candidate as at least part of the solution to the problem situation in the computer game.

9. The computer-readable storage medium of claim 8, wherein the operation further comprises:

receiving user input specifying at least one of;

(i) a candidate of the plurality of candidates and (ii) a fact pattern of the plurality of fact patterns.

10. The computer-readable storage medium of claim 8, wherein at least one of the plurality of fact patterns comprises one of an object and a statement made by one of the plurality of candidates.

11. The computer-readable storage medium of claim 10, wherein the statement made by one of the plurality of candidates links another candidate of the plurality of candidates to at least one of the object and the designation.

12. The computer-readable storage medium of claim 8, wherein the association in the data structure is further determined based on a taxonomy comprising at least one noun label representing an object and at least one adjective label representing a trait of a candidate.

13. The computer-readable storage medium of claim 8, wherein each candidate of the plurality of candidates is uniquely identified using a plurality of traits that characterize a physical appearance of the respective candidate.

14. The computer-readable storage medium of claim 8, wherein the data structure comprises a graph, and wherein the plurality of candidates, the plurality of fact patterns, and the designation are represented as nodes in the graph.

15. A system, comprising:

one or more computer processors;

a memory containing a program which, when executed by the one or more computer processors, is configured to perform an operation comprising;

providing a framework for generating a plurality of problem situations in a computer game, wherein the framework comprises a data structure representing;

(i) a plurality of candidates associated with the plurality of problem situations, (ii) a plurality of fact patterns associated with the plurality of candidates, and (iii) a designation of at least one of the plurality of candidates as a solution to a problem situation of the plurality of problem situations;

wherein each of the plurality of fact patterns includes at least one property used for determining an association in the data structure, wherein the data structure comprises a chain of inference between the designation and each candidate of the plurality of candidates, wherein each chain of inference comprises at least one of the plurality of fact patterns; and

generating, from the data structure, a representation of the problem situation by determining a subset of the plurality of fact patterns of the data structure to include in the representation of the problem situation, wherein the representation of the problem situation comprises the chain of inference between the designation and a candidate of the plurality of candidates, whereby the chain of inference designates the candidate as at least part of the solution to the problem situation in the computer game.

16. The system of claim 15, wherein the operation further comprises:

receiving user input specifying at least one of;

(i) a candidate of the plurality of candidates and (ii) a fact pattern of the plurality of fact patterns.

17. The system of claim 15, wherein at least one of the plurality of fact patterns comprises one of an object and a statement made by one of the plurality of candidates.

18. The system of claim 17, wherein the statement made by one of the plurality of candidates links another candidate of the plurality of candidates to at least one of the object and the designation.

19. The system of claim 15, wherein the association in the data structure is further determined based on a taxonomy comprising at least one noun label representing an object and at least one adjective label representing a trait of a candidate.

20. The system of claim 15, wherein each candidate of the plurality of candidates is uniquely identified using a plurality of traits that characterize a physical appearance of the respective candidate.

21. The system of claim 15, wherein the data structure comprises a graph, and wherein the plurality of candidates, the plurality of fact patterns, and the designation are represented as nodes in the graph.

22. A data structure stored on a computer readable storage medium, wherein the data structure comprises:

(i) a plurality of candidates associated with a plurality of problem situations of a computer game;

(ii) a plurality of fact patterns associated with the plurality of candidates;

(iii) a designation of at least one of the plurality of candidates as a solution to a problem situation of the plurality of problem situations; and

(iv) a chain of inference between the designation and each candidate of the plurality of candidates, wherein each chain of inference comprises at least one of the plurality of fact patterns;

wherein each of the plurality of fact patterns includes at least one property used for determining an association in the data structure, wherein a representation of the problem situation is generated from the data structure by determining a subset of the plurality of fact patterns of the data structure to include in the representation of the problem situation, wherein the representation of the problem situation comprises the chain of inference between the designation and a candidate of the plurality of candidates, whereby the chain of inference designates the candidate as at least part of the solution to the problem situation in the computer game.

23. A computer-implemented method, comprising:

providing a framework for generating a plurality of mysteries in a computer game, wherein the framework comprises a data structure representing;

(i) a plurality of suspects associated with the plurality of mysteries, (ii) a plurality of clues associated with the plurality of suspects, and (iii) a designation of at least one of the plurality of suspects as a culprit;

wherein the data structure comprises a chain of inference between the designation and each suspect of the plurality of suspects, wherein each of the plurality of clues includes at least one property used for determining an association in the data structure, wherein each chain of inference comprises at least one of the plurality of clues; and

generating, from the data structure and by operation of one or more computer processors, a representation of a mystery by determining a subset of the plurality of clues of the data structure to include in the representation of the mystery, wherein the representation of the mystery comprises the chain of inference between the designation and a suspect of the plurality of suspects, whereby the chain of inference designates the suspect as the culprit of the mystery in the computer game.