Office Action 1: Non-Final Rejection (2024-09-12)
Rejection types: 101 - Patent-Eligible Subject Matter, 102 - Lack of Novelty

CLAIMS:
CLAIMS

What is claimed is:

1\. A method for interactive plot jumping, executed by a computer device, the method comprising:
obtaining current node information comprising a first plot path that reaches a current node and a plot parameter of the current node, the current node indicating a plot where a user is currently located, and the plot parameter reflecting a user status of the user at the current node;
obtaining target node information in response to a plot jump instruction for a target node, the target node information comprising a plot parameter of the target node and a historical plot path by which the target node has been reached, and the plot jump instruction instructing a plot to jump from the current node to the target node;
performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition, the spliced plot path leading to the target node; and
updating the plot parameter corresponding to the target node based on the spliced plot path.

2\. The method according to claim 1, wherein the performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition comprises:
performing the path splicing on the first plot path and the historical plot path according to a default splicing rule to obtain a default spliced plot path;
when the default spliced plot path conforms with the plot logic rule, using the default spliced plot path as the spliced plot path; and
when the default spliced plot path does not conform to the plot logic rule, performing the path splicing on the first plot path and the historical plot path based on a superior-subordinate relationship between the current node and the target node, to obtain the spliced plot path that conforms to the plot logic rule and satisfies the plot parameter condition.

3\. The method according to claim 2, wherein the performing the path splicing on the first plot path and the historical plot path based on a superior-subordinate relationship between the current node and the target node, to obtain the spliced plot path that conforms to the plot logic rule and satisfies the plot parameter condition comprises:
when the superior-subordinate relationship exists between the current node and the target node, performing depth-first search processing in plot nodes before the target node to obtain a plot splicing node that conforms to the plot logic rule, wherein plot nodes after the current node do not change the plot parameter of the current node; and generating the spliced plot path based on the plot splicing node;
when the superior-subordinate relationship does not exist between the current node and the target node, changing, based on a target plot parameter that causes the default spliced plot path to not conform to the plot logic rule, a plot node involving a change of the target plot parameter in the default spliced plot path to obtain the spliced plot path that conforms to the plot logic rule, wherein plot parameters in the spliced plot path other than the target plot parameter satisfy the plot parameter condition.

4\. The method according to claim 3, wherein before the performing depth-first search processing in plot nodes before the target node to obtain a plot splicing node that conforms to the plot logic rule, the method further comprises:
obtaining read plot nodes after a target determination node, the target determination node being a plot node that causes the default spliced plot path to not conform to the plot logic rule and involving a determination of the target plot parameter, and the read plot nodes being plot nodes that have been reached; and
the performing depth-first search processing in plot nodes before the target node to obtain plot splicing nodes that conform to the plot logic rule comprises:
performing the depth-first search processing in the read plot nodes after the target determination node to obtain the plot splicing node that conforms to the plot logic rule.

5\. The method according to claim 4, wherein the performing the depth-first search processing in the read plot nodes after the target determination node to obtain the plot splicing node that conforms to the plot logic rule comprises:
removing plot nodes that are on the historical path among exit nodes of the target determination node to obtain remaining read plot nodes; and
performing the depth-first search processing in the remaining read plot nodes to obtain the plot splicing node that conforms to the plot logic rule.

6\. The method according to claim 4, wherein the performing the depth-first search processing in the read plot nodes after the target determination node to obtain the plot splicing node that conforms to the plot logic rule comprises:
detecting a number of recursions of the depth-first search processing;
when the number of recursions is fewer than a threshold, performing node determination processing on a current search node, the current search node being a plot node that the depth-first search processing reaches at a current moment, and a starting position of the depth-first search processing being a target exit node of the target determination node;
when the current search node fails the node determination processing, using a next exit node of the current search node as the current search node, incrementing the number of recursions, and performing the operation of detecting a number of recursions of the depth-first search processing;
when the current search node passes the node determination processing, performing plot logic verification on the current search node; when the current search node passes the plot logic verification, determining the current search node as the plot splicing node;
when the current search node fails the plot logic verification, using a next exit node of the current search node as the current search node, incrementing the number of recursions, and
performing the operation of detecting a number of recursions of the depth-first search processing;
when the number of recursions reaches the threshold, detecting whether any of exit nodes of the current search node is on the historical plot path that reaches the target node;
when none of the exit nodes of the current search node is on the historical plot path, removing a recursive branch where the current search node is located;
when the exit nodes of the current search node comprise a target exit node on the historical plot path, performing the plot logic verification on the target exit node;
when the target exit node passes the plot logic verification, using the target exit node as the plot splicing node;
when the target exit node fails the plot logic verification, removing the recursive branch where the current search node is located.

7\. The method according to claim 6, wherein the performing node determination processing on a current search node comprises:
when the current search node is the target node or is on the historical plot path, determining that the current search node passes the node determination processing; otherwise, determining that the current search node does not pass the node determination processing; and the performing plot logic verification on the current search node comprises:
performing path splicing on the first plot path and a historical path after the current search node to generate a temporary spliced path; and when the temporary spliced path conforms to the plot logic rule, determining that the current search node passes the plot logic verification; otherwise, determining that the current search node does not pass the plot logic verification.

8\. The method according to claim 4, wherein the generating the spliced plot path based on the plot splicing node comprises:
performing path splicing on the first plot path and a historical path after the plot splicing node on the historical plot path to generate the spliced plot path; or
using the temporary spliced path that conforms to the plot logic rule as the spliced plot path.

9\. The method according to claim 3, wherein the changing, based on a target plot parameter that causes the default spliced plot path to not conform to the plot logic rule, a plot node involving a change of the target plot parameter in the default spliced plot path to obtain the spliced plot path that conforms to the plot logic rule comprises:
marking the target plot parameter;
obtaining all intersection nodes of the first plot path and the historical plot path;
checking a parameter modification on a path interval between every two adjacent intersection nodes on the first plot path by checking whether a plot node in the path interval is associated with a value change operation performed on the marked target plot parameter;
when no plot node in the path interval is associated with the value change operation performed on the target plot parameter, using, in the target path interval, a path formed between adjacent intersection nodes on the first plot path that correspond to the target path interval; when a plot node in the path interval is associated with the value change operation performed on the target plot parameter, using, in the target path interval, a path formed between adjacent intersection nodes on the historical plot path that correspond to the target path interval, to obtain an adjusted first plot path;
splicing the adjusted first plot path with the historical plot path after a last intersection node to obtain a replacing spliced path;
when the replacing spliced path conforms to the plot logic rule, determining the replacing spliced path as the spliced plot path, and stopping checking the parameter modification on a next path interval;
and when the replacing spliced path does not conform to the plot logic rule, checking the parameter modification on the next path interval.

10\. The method according to claim 3, wherein before the performing depth-first search processing in plot nodes before the target node to obtain a plot splicing node that conforms to the plot logic rule, the method further comprises:
determining a target determination node in intersection nodes of the first plot path and the historical plot path, the target determination node being a node that causes the default spliced plot path to not conform to the plot logic rule, and the target determination node being associated with a plot parameter determination.

11\. A method for displaying an interactive plot interface, executed by a computer device, the method comprising:
displaying a current node and a first plot path that reaches the current node in a plot structure interface, the current node indicating a plot where a user is currently located; obtaining, in response to a plot jump operation for a target node, a plot parameter of the current node and a historical plot path by which the target node has been reached, the plot jump operation instructing a plot to jump from the current node to the target node;
performing path splicing on the first plot path and the historical plot path, and displaying a spliced plot path obtained by the splicing, the first plot path being spliced with the historical plot path when the plot parameter of the current node satisfies a plot parameter condition, to obtain the spliced plot path leading to the target node and conforming to a plot logic rule; and
updating and displaying a plot parameter corresponding to the target node based on the plot parameter of the current node and the spliced plot path.

12\. A non-transitory computer-readable storage medium, storing at least one instruction, at least one program, a code set, or an instruction set, the at least one instruction, the at least one program, the code set, or the instruction set being loaded and executed by a processor to implement the method, the method comprising:
obtaining current node information comprising a first plot path that reaches a current node and a plot parameter of the current node, the current node indicating a plot where a user is currently located, and the plot parameter reflecting a user status of the user at the current node;
obtaining target node information in response to a plot jump instruction for a target node, the target node information comprising a plot parameter of the target node and a historical plot path by which the target node has been reached, and the plot jump instruction instructing a plot to jump from the current node to the target node;
performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition, the spliced plot path leading to the target node; and updating the plot parameter corresponding to the target node based on the spliced plot path.

13\. The computer-readable storage medium according to claim 12, wherein the performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition comprises:
performing the path splicing on the first plot path and the historical plot path according to a default splicing rule to obtain a default spliced plot path;
when the default spliced plot path conforms with the plot logic rule, using the default spliced plot path as the spliced plot path; and
when the default spliced plot path does not conform to the plot logic rule, performing the path splicing on the first plot path and the historical plot path based on a superior-subordinate relationship between the current node and the target node, to obtain the spliced plot path that conforms to the plot logic rule and satisfies the plot parameter condition.

14\. The computer-readable storage medium according to claim 12, wherein the performing the path splicing on the first plot path and the historical plot path based on a superior-subordinate relationship between the current node and the target node, to obtain the spliced plot path that conforms to the plot logic rule and satisfies the plot parameter condition comprises:
when the superior-subordinate relationship exists between the current node and the target node, performing depth-first search processing in plot nodes before the target node to obtain a plot splicing node that conforms to the plot logic rule, wherein plot nodes after the current node do not change the plot parameter of the current node; and generating the spliced plot path based on the plot splicing node;
when the superior-subordinate relationship does not exist between the current node and the target node, changing, based on a target plot parameter that causes the default spliced plot path to not conform to the plot logic rule, a plot node involving a change of the target plot parameter in the default spliced plot path to obtain the spliced plot path that conforms to the plot logic rule, wherein plot parameters in the spliced plot path other than the target plot parameter satisfy the plot parameter condition.

15\. The computer-readable storage medium according to claim 14, wherein before the performing depth-first search processing in plot nodes before the target node to obtain a plot splicing node that conforms to the plot logic rule, the method further comprises:
obtaining read plot nodes after a target determination node, the target determination node being a plot node that causes the default spliced plot path to not conform to the plot logic rule and involving a determination of the target plot parameter, and the read plot nodes being plot nodes that have been reached; and
the performing depth-first search processing in plot nodes before the target node to obtain plot splicing nodes that conform to the plot logic rule comprises:
performing the depth-first search processing in the read plot nodes after the target determination node to obtain the plot splicing node that conforms to the plot logic rule.

16\. The computer-readable storage medium according to claim 15, wherein the performing the depth-first search processing in the read plot nodes after the target determination node to obtain the plot splicing node that conforms to the plot logic rule comprises:
removing plot nodes that are on the historical path among exit nodes of the target determination node to obtain remaining read plot nodes; and
performing the depth-first search processing in the remaining read plot nodes to obtain the plot splicing node that conforms to the plot logic rule.
17\. The computer-readable storage medium according to claim 15, wherein the performing the depth-first search processing in the read plot nodes after the target determination node to obtain the plot splicing node that conforms to the plot logic rule comprises:
detecting a number of recursions of the depth-first search processing;
when the number of recursions is fewer than a threshold, performing node determination processing on a current search node, the current search node being a plot node that the depth-first search processing reaches at a current moment, and a starting position of the depth-first search processing being a target exit node of the target determination node;
when the current search node fails the node determination processing, using a next exit node of the current search node as the current search node, incrementing the number of recursions, and
performing the operation of detecting a number of recursions of the depth-first search processing;
when the current search node passes the node determination processing, performing plot logic verification on the current search node; when the current search node passes the plot logic verification, determining the current search node as the plot splicing node;
when the current search node fails the plot logic verification, using a next exit node of the current search node as the current search node, incrementing the number of recursions, and
performing the operation of detecting a number of recursions of the depth-first search processing;
when the number of recursions reaches the threshold, detecting whether any of exit nodes of the current search node is on the historical plot path that reaches the target node;
when none of the exit nodes of the current search node is on the historical plot path, removing a recursive branch where the current search node is located;
when the exit nodes of the current search node comprise a target exit node on the historical plot path, performing the plot logic verification on the target exit node;
when the target exit node passes the plot logic verification, using the target exit node as the plot splicing node;
when the target exit node fails the plot logic verification, removing the recursive branch where the current search node is located.

18\. The computer-readable storage medium according to claim 17, wherein the performing node determination processing on a current search node comprises:
when the current search node is the target node or is on the historical plot path, determining that the current search node passes the node determination processing; otherwise, determining that the current search node does not pass the node determination processing; and
the performing plot logic verification on the current search node comprises:
performing path splicing on the first plot path and a historical path after the current search node to generate a temporary spliced path; and when the temporary spliced path conforms to the plot logic rule, determining that the current search node passes the plot logic verification; otherwise, determining that the current search node does not pass the plot logic verification.

19\. The computer-readable storage medium according to claim 15, wherein the generating the spliced plot path based on the plot splicing node comprises:
performing path splicing on the first plot path and a historical path after the plot splicing node on the historical plot path to generate the spliced plot path; or
using the temporary spliced path that conforms to the plot logic rule as the spliced plot path.
20\. The computer-readable storage medium according to claim 14, wherein the changing, based on a target plot parameter that causes the default spliced plot path to not conform to the plot logic rule, a plot node involving a change of the target plot parameter in the default spliced plot path to obtain the spliced plot path that conforms to the plot logic rule comprises:
marking the target plot parameter;
obtaining all intersection nodes of the first plot path and the historical plot path;
checking a parameter modification on a path interval between every two adjacent intersection nodes on the first plot path by checking whether a plot node in the path interval is associated with a value change operation performed on the marked target plot parameter;
when no plot node in the path interval is associated with the value change operation performed on the target plot parameter, using, in the target path interval, a path formed between adjacent intersection nodes on the first plot path that correspond to the target path interval;
when a plot node in the path interval is associated with the value change operation performed on the target plot parameter, using, in the target path interval, a path formed between adjacent intersection nodes on the historical plot path that correspond to the target path interval, to obtain an adjusted first plot path;
splicing the adjusted first plot path with the historical plot path after a last intersection node to obtain a replacing spliced path;
when the replacing spliced path conforms to the plot logic rule, determining the replacing spliced path as the spliced plot path, and stopping checking the parameter modification on a next path interval;
and when the replacing spliced path does not conform to the plot logic rule, checking the parameter modification on the next path interval. 21PCT571/US44 21PCT571/US45 21PCT571/US46 21PCT571/US47 21PCT571/US48 21PCT571/US49 21PCT571/US50 21PCT571/US51 21PCT571/US52 21PCT571/US53 21PCT571/US54 21PCT571/US55

OFFICE ACTION:
Notice of Pre-AIA  or AIA  Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1 to 20 (independent Claims 1, 11, and 12, and their dependent claims) are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (i.e., a law of nature, a natural phenomenon, or an abstract idea) without significantly more. The claims are drawn to a method and a computer-readable medium, and so are statutory classes under 101.  The claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception because of the following reasons.  Independent Claim 1 is representative and is reproduced below; the abstract idea is underlined and the structural limitations are not.  The dependent claims have no more structure than the independent claim and fail 101 for similar reasons.
A method for interactive plot jumping, executed by a computer device, the method comprising: (processing data according to the rules of a game)
obtaining current node information comprising a first plot path that reaches a current node and a plot parameter of the current node, the current node indicating a plot where a user is currently located, and the plot parameter reflecting a user status of the user at the current node; (processing data according to the rules of a game, outputting the result)
obtaining target node information in response to a plot jump instruction for a target node, the target node information comprising a plot parameter of the target node and a historical plot path by which the target node has been reached, and the plot jump instruction instructing a plot to jump from the current node to the target node; (processing data according to the rules of a game, outputting the result)
performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition, the spliced plot path leading to the target node; and (processing data according to the rules of a game)
updating the plot parameter corresponding to the target node based on the spliced plot path. (processing data according to the rules of a game, outputting the result)
The claims taken together or individually do not represent an improvement to the abstract idea in an ordered combination.  The claims do not cite specific processor or memory structures for processing data in memory according to the rules of a game.  The claims do not cite specific input structures such as touchscreens, touchpads, directional pads, joysticks, trackballs, keyboards, mice, cameras, or microphones.  The claims do not cite specific output structures such as screens, displays, or speakers.  The claims appear to pertain to physical location of a player in a virtual game space, but they are worded broadly enough that they could pertain to changing the “plot” or “script” (like a narrative or storyline) of a game.  It is also unclear what type of game is being played like action, sports, role-playing, etc.  No input is accepted from the player to determine the change to the game’s plot, and not output is displayed to the player indicating the changes to the game’s plot.  The claims do not represent an improvement in the functioning of a computing device or gaming device since they do not represent an improvement in processor speed, memory management, random number generation, thermal management, ergonomics, network speed and management (such as load balancing or rerouting of packets), bus speed and management, authentication, encryption, graphics rendering, or reduced instruction sets for carrying out complex operations (such as RISC processors).  Applying an abstract idea to a computer is not patent-eligible (Alice, http://www.supremecourt.gov/opinions/13pdf/13-298_7lh8.pdf, page 12).  Electronic recordkeeping, obtaining data, adjusting balances, issuing automated instructions, creating and maintaining accounts are typical computer functions (Alice, page 15).  Requiring the use of a computer to implement the claim does not make it patent-eligible (pages 14 & 15).  Communications controllers, data storage units, and data processing systems are typical computer structures (Alice, page 16).  Calculation, storage, and transmission are basic computer functions (Alice, page 16).  Claims cannot simply be a draftsman’s art (Alice, pages 14 & 16).
Cloud Satchel quoting Bancorp: “To salvage an otherwise patent-ineligible process, a computer must be integral to the claimed invention, facilitating the process in a way that a person making calculations or computations could not.”  In Bancorp, the independent claims did not require a computer (at 1431).  In Bancorp, the system and method claims were equivalent for patentability under 101 (at 1432).  Bancorp’s method claims did not require a computer and were not 101-compliant (at 1433).  A computer must be integral to the claimed invention (Bancorp at 1433).  A computer used in the claim only for its most basic functions does not make the claim 101-eligible (Bancorp at 1433).  Bancorp’s use of computers to track, reconcile, and administer insurance policies only used a computer’s most basic functions, adding nothing to 101 compliance (1434).  Limiting the claims to a particular field of use, such as the insurance market, does not fail to preempt the abstract idea (Bancorp at 1434 & 1435).  In Amdocs (113 USPQ2d 1565) at 1571, the fact that the claims cannot be carried out by a human being alone does not mean that they are not an abstract idea under 101 (citing Alice, 134 S.Ct. at 2359-60 and Digitech, 758 F.3d at 1351).
The examiner points the applicants to Claim 33 of U.S. patent 5,970,479 A which was the representative claim in the Alice decision.  These claim limitations are carried out on presumably a general purpose computer although such is not explicitly cited.  The claims are certainly not carried out by specific hardware.
A method of exchanging obligations as between parties, each party holding a credit record and a debit record with an exchange institution, the credit records and debit records for exchange of predetermined obligations, the method comprising the steps of:
(a) creating a shadow credit record and a shadow debit record for each stakeholder party to be held independently by a supervisory institution from the exchange institutions;
(b) obtaining from each exchange institution a start-of-day balance for each shadow credit record and shadow debit record;
(c) for every transaction resulting in an exchange obligation, the supervisory institution adjusting each respective party’s shadow credit record or shadow debit record, allowing only these transactions that do not result in the value of the shadow debit record being less than the value of the shadow credit record at any time, each said adjustment taking place in chronological order, and
(d) at the end-of-day, the supervisory institution instructing on[e] of the exchange institutions to exchange credits or debits to the credit record and debit record of the respective parties in accordance with the adjustments of the said permitted transactions, the credits and debits being irrevocable, time invariant obligations placed on the exchange institutions.
The examiner points the applicants to representative Claim 19 of U.S. patent 7,818,399 B1 which was at issue in the DDR Holdings case.  This claim in the DDR Holdings case was 101-compliant because it improved the functioning of the computer itself, namely rendering web pages in a web browser.  The claims in DDR Holdings cited what was done, and specific steps for how it was done, thus not invoking a judicial exception by preempting all possible ways of what the claim is trying to do.  The claims met the second step of the Alice analysis by improving on how web page rendering transactions were carried out over a network such as the Internet, versus how such transactions had been done before.
A system useful in an outsource provider serving web pages offering commercial opportunities, the system comprising:
(a) a computer store containing data, for each of a plurality of first web pages, defining a plurality of visually perceptible elements, which visually perceptible elements correspond to the plurality of first web pages;
(i) wherein each of the first web pages belongs to one of a plurality of web page owners;
(ii) wherein each of the first web pages displays at least one active link associated with a commerce object associated with a buying opportunity of a selected one of a plurality of merchants; and
(iii) wherein the selected merchant, the outsource provider, and the owner of the first web page displaying the associated link are each third parties with respect to one other;
(b) a computer server at the outsource provider, which computer server is coupled to the computer store and programmed to:
(i) receive from the web browser of a computer user a signal indicating activation of one of the links displayed by one of the first web pages;
(ii) automatically identify as the source page the one of the first web pages on which the link has been activated;
(iii) in response to identification of the source page, automatically retrieve the stored data corresponding to the source page; and
(iv) using the data retrieved, automatically generate and transmit to the web browser a second web page that displays: (A) information associated with the commerce object associated with the link that has been activated, and (B) the plurality of visually perceptible elements visually corresponding to the source page.
The examiner finds that wagering games are all rather similar: accepting a wager, playing the game according to the rules comprising generating random outcomes according to rules, determining winning outcomes, determining how much is to be paid for a winning outcome, and paying out the winnings.  This breakdown of the wagering claim language is similar to that in precedential case in re Smith (in re Smith (Fed. Cir. 2016), appeal 2015-1664, U.S. patent application 12/912,410).
Claim 1 at hand in in re Smith is as follows:
1. A method of conducting a wagering game comprising:
[a]) a dealer providing at least one deck of physical playing cards and shuffling the physical playing cards to form a random set of physical playing cards;
[b]) the dealer accepting at least one first wager from each participating player on a player game hand against a banker’s/dealer’s hand;
[c]) the dealer dealing only two cards from the random set of physical playing cards to each designated player and two cards to the banker/dealer such that the designated player and the banker/ dealer receive the same number of exactly two random physical playing cards;
[d]) the dealer examining respective hands to determine in any hand has a Natural 0 count from totaling count from cards, defined as the first two random physical playing cards in a hand being a pair of 5’s, 10’s, jacks, queens or kings;
[e]) the dealer resolving any player versus dealer wagers between each individual player hand that has a Natural 0 count and between the dealer hand and all player hands where a Natural 0 is present in the dealer hand, while the dealer exposes only a single card to the players;
[f]) as between each player and the dealer where neither hand has a Natural 0, the dealer allowing each player to elect to take a maximum of one additional card or standing pat on the initial two card player hand, while still having seen only one dealer card;
[g]) the dealer/banker remaining pat within a first certain predetermined total counts and being required to take a single hit within a second predetermined total counts, where the first total counts range does not overlap the second total counts range;
[h]) after all possible additional random physical playing cards have been dealt, the dealer comparing a value of each designated player’s hand to a final value of the banker’s/dealer’s hand wherein said value of the designated player’s hand and the banker’s/dealer’s hand is in a range of zero to nine points based on a pre-established scoring system wherein aces count as one point, tens and face cards count as zero points and all other cards count as their face value and wherein a two-digit hand total is deemed to have a value corresponding to the one’s digit of the two-digit total;
[i]) the dealer resolving the wagers based on whether the designated player’s hand or the banker’s/dealer’s hand is nearest to a value of 0.
Similarly to the present claims, the claim at hand in in re Smith accepted wagers from players (steps a & b), played the game according to the rules of the game comprising generating random outcomes (steps c to g), determining what the winning conditions are and how much to pay out (step h), and making the winning payouts (step i).  The card game of in re Smith would be identical played in a card and table format or in an electronic format.
The examiner points the applicants to the representative claim at hand in non-precedential Planet Bingo.  The hardware limitations of the CPU, memory, I/O terminal, and printer are only cited in clause (a).  The rest of the claim is functional claim language describing a bingo game that would occur identically in paper ticket format or computerized format with the play of the game and the game results being identical in either format.  The court held that the claims in Planet Bingo were ineligible under 101.
A method for playing a game of Bingo which comprises the steps of:
(a) providing a system for managing a game of Bingo which comprises: a computer with a central processing unit (CPU) and with a memory and with a printer connected to the CPU; an input and output terminal connected to the CPU and memory of the computer; and a program in the computer enabling:
(i) input of at least two sets of Bingo numbers which are preselected by a player for repetitive play in games of Bingo over a period of time;
(ii) storage of the sets of Bingo numbers which are preselected by the player as a group in the memory of the computer;
(iii) assignment of a player identifier unique to the player for the group having the sets of Bingo numbers which are preselected by the player wherein the player identifier is assigned to the group for multiple sessions of Bingo;
(iv) retrieval of the group using the player identifier;
(v) selection from the group by the player of at least one of the sets of Bingo numbers preselected by the player and stored in the memory of the computer as the group for play in a selected game of Bingo in a specific session of Bingo wherein a number of sets of Bingo numbers selected for play in the selected game of Bingo is less than a total number of sets of Bingo numbers in the group;
(vi) addition by the computer of a control number for the set of Bingo numbers which is selected by the player for play in the selected game of Bingo;
(vii) output of a receipt with the control number, the set of Bingo numbers which is selected for play in the selected game of Bingo, a price for the set of Bingo numbers which is selected for play in the selected game of Bingo, a date of the selected game of Bingo and optionally a computer identification number; and
(viii) output for verification of a winning set of Bingo numbers by means of the control number which is input into the computer by a manager of the game of Bingo;
(b) playing the game of Bingo using the set of Bingo numbers wherein the player signals a Bingo to indicate the set of Bingo numbers which is selected for play in the selected game of Bingo is the winning set of Bingo numbers; and
(c) verifying the winning set of Bingo numbers with the control number with the program.
The Bascom decision is relevant to the present claims (U.S. CAFC, 2015-1763, decided June 27th, 2016).  The Bascom decision required that the ordered limitations of the claims taken together add something significantly more to the abstract idea even though the individual limitations were known in the prior art.  The claim at hand in Bascom was found to comply with 101 in light of Alice.  Page 15 of Bascom: “However, we disagree with the district court’s analysis of the ordered combination of limitations. In light of Mayo and Alice, it is of course now standard for a § 101 inquiry to consider whether various claim elements simply recite “well-understood, routine, conventional activit[ies].” Alice, 134 S. Ct. at 2359. The district court’s analysis in this case, however, looks similar to an obviousness analysis under 35 U.S.C. § 103, except lacking an explanation of a reason to combine the limitations as claimed. The inventive concept inquiry requires more than recognizing that each claim element, by itself, was known in the art. As is the case here, an inventive concept can be found in the non-conventional and non-generic arrangement of known, conventional pieces.”  Page 20 of Bascom: “While the claims of the ’606 patent are directed to the abstract idea of filtering content, BASCOM has adequately alleged that the claims pass step two of Alice’s two-part framework. BASCOM has alleged that an inventive concept can be found in the ordered combination of claim limitations that transform the abstract idea of filtering content into a particular, practical application of that abstract idea. We find nothing on this record that refutes those allegations as a matter of law or justifies dismissal under Rule 12(b)(6). We therefore vacate the district court’s order granting AT&T’s motion to dismiss under FRCP 12(b)(6) and remand so that the case may proceed.”
The McRO decision (U.S. CAFC, 2015-1080 to 2015-1101, decided Sept. 13th, 2016) is relevant to the present claims.  The McRO decision stated that an ordered combination of claim limitations can meet the requirements of 101 in light of the Alice decision by improving over what has been already done in the prior art without preempting an abstract idea.  Pages 25 and 26 of McRO: “The limitations in claim 1 prevent preemption of all processes for achieving automated lip-synchronization of 3-D characters. McRO has demonstrated that motion capture animation provides an alternative process for automatically animating lip synchronization and facial expressions. Even so, we have recognized that “the absence of complete preemption does not demonstrate patent eligibility.” Ariosa Diagnostics, Inc. v. Sequenom, Inc., 788 F.3d 1371, 1379 (Fed. Cir. 2015). The narrower concern here is whether the claimed genus of rules preempts all techniques for automating 3-D animation that rely on rules. Claim 1 requires that the rules be rendered in a specific way: as a relationship between subsequences of phonemes, timing, and the weight to which each phoneme is expressed visually at a particular timing (as represented by the morph weight set). The specific structure of the claimed rules would prevent broad preemption of all rules-based means of automating lip synchronization, unless the limits of the rules themselves are broad enough to cover all possible approaches. There has been no showing that any rules-based lip synchronization process must use rules with the specifically claimed characteristics.”  Page 27 of McRO: “Here, the structure of the limited rules reflects a specific implementation not demonstrated as that which “any [animator] engaged in the search for [an automation process] would likely have utilized.” Myriad, 133 S. Ct. at 2119–20 (quotation marks omitted). By incorporating the specific features of the rules as claim limitations, claim 1 is limited to a specific process for automatically animating characters using particular information and techniques and does not preempt approaches that use rules of a different structure or different techniques. See Morse, 56 U.S. at 113. When looked at as a whole, claim 1 is directed to a patentable, technological improvement over the existing, manual 3-D animation techniques. The claim uses the limited rules in a process specifically designed to achieve an improved technological result in conventional industry practice. Alice, 134 S. Ct. at 2358 (citing Diehr, 450 U.S. at 177). Claim 1 of the ’576 patent, therefore, is not directed to an abstract idea.”  The claim limitations individually or taken together add nothing significantly more in an ordered combination to the abstract idea.
Claim Rejections - 35 USC § 102
In the event the determination of the status of the application as subject to AIA  35 U.S.C. 102 and 103 (or as subject to pre-AIA  35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA  to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claim(s) 1 to 20 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Yang, et al. (Chinese patent publication CN 109794064 A, application 201811641511.6).
As to Claims 1 to 20: Yang teaches a method for interactive plot jumping, executed by a computer device, the method comprising: obtaining current node information comprising a first plot path that reaches a current node and a plot parameter of the current node (Abst., page 1; summary of the invention pages 1 and 2), the current node indicating a plot where a user is currently located (page 7, fifth to seventh paragraphs), and the plot parameter reflecting a user status of the user at the current node (page 7, fifth to seventh paragraphs); obtaining target node information in response to a plot jump instruction for a target node (page 11, ninth and tenth paragraphs to page 12, first to sixth paragraphs), the target node information comprising a plot parameter of the target node and a historical plot path by which the target node has been reached (page 8, third paragraph and seventh to twelfth paragraphs), and the plot jump instruction instructing a plot to jump from the current node to the target node (Fig. 3e, page 25, second to sixth paragraphs); performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition, the spliced plot path leading to the target node (plot path spliced or changed, page 19, fourth to eighth paragraphs, page 21, second and third paragraphs); and updating the plot parameter corresponding to the target node based on the spliced plot path (plot path spliced or changed, page 19, fourth to eighth paragraphs, page 21, second and third paragraphs).  See Claim 1: “An interactive story realizing method, wherein, comprising: a display scenario structure interface, comprising several players has entered the game scenario structure interface capable of reading a game scenario, each scenario block corresponding to one or more scenario. each reading scenario block storing a scenario path data, receiving player through the scenario structure interface triggering scenario jump instruction according to the scenario jumping instruction determining game scenario and the required jump target scenario block can be read. the target can read scenario block is stored with a target scenario path data of the target scenario path, when the takeoff scenario block is located on the target scenario path, determining takeoff scenario path data of the scenario block storage, whether the path on the game logic scenario path with the target data, if the path, then updates the target scenario path data according to the take-off scenario path data according to the target scenario path data updated into the target can read scenario block corresponding to the scenario.”
Conclusion

APPLICANT REBUTTAL: REMARKS
the Examiner rejected claims 1-20 under 35 U.S.C. @ 101as being directed to a judicial exception without significantly more; rejected claims 1-20 under 35 U.S.C. @ 102 as being anticipated by Yang et al. (Chinese Patent Application Publication No. CN 109794064, hereinafter Yang).
By this Amendment, Applicant amends claims 1, 3, 10, 12, and 15, cancels claims 2, 11, and 13 without any prejudice and disclaimer of the subject matter thereof, and adds new claims 21-23. Support for the amendments can be found throughout the as-filed application, for example, in para. [0074]-[0077], [0109], and [0139]-[0161] of the specification and FIGS.4-5 of the drawings. Upon entry of this Amendment, claims 1, 3-10, 12, and 14-23 remain pending and under examination.
Applicant respectfully requests that the Office favorably reconsider and withdraw the rejections, and timely allow the pending claims for at least the reasons set forth below.
Reg
ardin
g
Interview
Applicant thanks the Examiner for conducting the phone interview with the undersigned Applicant's representative on October 29, 2024, to discuss the amended claims and applied references, and the Examiner agreed that the amended claims overcome the applied references and the Section 101 rejection. Applicant understands that further search and consideration may be conducted.
ted art and the claims.Regardless of whether any such statement is identified herein, Applicant decline
atically subscribe to any statement or characterization in the Office Action.
Reg
ardin
g
Claim Re
j
ections under 35 U.S.C.
&
Applicant respectfully traverses the rejection of claims 1-20 under 35 U.S.C. § 101 as
allegedly being directed to an abstract idea without significantly more. To advance prosecution, Applicant amends independent claims 1 and 12 to further claim the invention. As agreed during the interview, Applicant respectfully submits that the amended claims are patent eligible, and requests withdrawal of the rejections to claims 1 and 12 and their respective dependent claims.
Reg
ardin
g
Claim Re
j
ection under 35 U.S.C.
&
Applicant respectfully traverses the rejection of claims 1-20 under 35 U.S.C. § 102 as allegedly being anticipated by Yang. However, to expedite the prosecution of the present application, Applicant amends independent claims 1 and 12 by incorporating the subject matter recited in the now cancelled claim 2 and other limitations to further define the claimed invention.
As agreed during the interview, Applicant respectfully submits that Yang fails to teach or suggest, "performing path splicing on the first plot path and the historical plot path according to a default splicing rule to obtain a default spliced plot path, wherein
the default spliced plot path is formed by a current path and a partial historical plot path, the current path starts from the root node and follows the first plot path to reach a first intersection node of the one or more intersection nodes, and the partial historical plot path starts from the first intersection node and follows the historical plot path to reach the target node;
in response to that the default spliced plot path conforms to a plot logic rule and satisfies a plot parameter condition, using the default spliced plot path as a target spliced plot path; in response to that the default spliced plot path does not conform to the plot logic rule,
identifying a determination node that causes the default spliced plot path to be logically unreachable, and performing path splicing on the first plot path and the historical plot path based on the determination node and a superior-subordinate
relationship between the current node and the tar
g
et node,
to obtain the target spliced plot path that conforms to the plot logic rule and satisfies the plot parameter condition," as recited in amended claim 1 (emphasis added), and similar features in amended independent claims 7 and 13.
Accordingly, Applicant respectfully requests withdrawal of the rejection under 35 U.S.C. § 102.
New Claims
Newly added independent claim 21, although different in scope from amended claim 1, recite elements similar to those of claim 1. For at least reasons similar to those discussed above with respect to the Section 102 rejection of claim 1, claim 21 is also allowable over the cited art, as well as its dependent new claims 22-23.
Conclusion

NEXT OFFICE ACTION: DETAILED ACTION
Notice of Pre-AIA  or AIA  Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Allowable Subject Matter
Claims 1, 3 to 10, 12, and 14 to 23 (independent Claims 1, 12, and 21, and their dependent claims) are allowed.
REASONS FOR ALLOWANCE
The following is an examiner’s statement of reasons for allowance: The closest prior art is Yang, et al. (Chinese patent publication CN 109794064 A, cited on the ISR for the parent PCT application).  Yang pertains a display scenario structure interface, and receiving player through the scenario structure interface triggering scenario jump instructions (Abst.; Claim 1).  For a detailed discussion of Yang, see NF (09-12-2024, pages 13 and 14).  Yang does not suggest the plot logic rules, current plot paths, and historical plot paths as claimed; in particular, it does not determine that a potential plot path is unreachable.
The present claims pertain to: “a method for interactive plot jumping, executed by a computer device, the method comprising: displaying, in a graphical plot structure interface of a game application and based on a game play progress of a user, a plurality of nodes and paths indicating multiple branches of a game plot of the game application; obtaining current node information comprising a first plot path that starts from a root node and reaches a current node and a plot parameter of the current node, the current node indicating a plot where  the user is currently located, and the plot parameter reflecting a user gaming status of the user at the current node; obtaining target node information in response to a plot jump instruction for a target node received on the graphical plot structure interface, the target node information comprising a plot parameter of the target node and a historical plot path by which the target node has been reached from the root node, the historical plot path and the first plot path having one or more intersection nodes, and the plot jump instruction instructing a plot to jump from the current node to the target node; performing path splicing on the first plot path and the historical plot path according to a default splicing rule to obtain a default spliced plot path, wherein the default spliced plot path is formed by a current path and a partial historical plot path, the current path starts from the root node and follows the first plot path to reach a first intersection node of the one or more intersection nodes, and the partial historical plot path starts from the first intersection node and follows the historical plot path to reach the target node; in response to that the default spliced plot path conforms to a plot logic rule and satisfies a plot parameter condition, using the default spliced plot path as a target spliced plot path; In response to that the default spliced plot path does not conform to the plot logic rule, identifying a determination node that causes the default spliced plot path to be logically unreachable, and performing path splicing on the first plot path and the historical plot path based on the determination node and a superior-subordinate relationship between the current node and the target node, to obtain the target spliced plot path that conforms to the plot logic rule and satisfies the plot parameter condition; updating the plot parameter corresponding to the target node based on the spliced plot path; and displaying the target spliced plot path on the graphical plot structure interface.”
In the typical prior art interactive games, which are often based on movie and television shows, the game plot unfolds in the form of video.  The game plot has multiple branches.  As the plot develops, different options will be displayed for the player to make reasonable choices.  The plot will go to different branches along with the player's choice, thus different video contents will be played.  Often, the path splicing solution implemented in these prior art games has a spliced plot path that is not logical.  The presently claimed invention includes obtaining current node information comprising a first plot path that reaches a current node and a plot parameter of the current node, the current node indicating a plot where a user is currently located, and the plot parameter reflecting a user status of the user at the current node; obtaining target node information in response to a plot jump instruction for a target node, the target node information comprising a plot parameter of the target node and a historical plot path by which the target node has been reached, and the plot jump instruction instructing a plot to jump from the current node to the target node; performing path splicing on the first plot path and the historical plot path to obtain a spliced plot path that conforms to a plot logic rule and satisfies a plot parameter condition, the spliced plot path leading to the target node; and updating the plot parameter corresponding to the target node based on the spliced plot path.  The present invention has the overall advantages of providing for smooth interactive plot jumping, clearly and logically displaying an interactive plot interface, and ensuring that the path obtained by splicing is logically smooth while reducing the impact on plot parameters.  The examiner respects that the applicants may have different reasons for allowance.
Any comments considered necessary by applicant must be submitted no later than the payment of the issue fee and, to avoid processing delays, should preferably accompany the issue fee.  Such submissions should be clearly labeled “Comments on Statement of Reasons for Allowance.”
Conclusion

CITED REFERENCE SUMMARIES: Ref US20240058697A1: Claims:
A method for generating a plot based on a state graph, the method comprising: displaying an editing interface, wherein the editing interface is configured to provide a plot editing function and comprises candidate state nodes indicating a plot development state of a plot; determining at least two target state nodes in response to receiving a configure operation on the candidate state nodes; receiving a timing relationship establish operation for at least two target state nodes, wherein the timing relationship establish operation is for configuring a timing relationship between the state nodes; and displaying a state graph comprising the at least two target state nodes in the editing interface based on the timing relationship establish operation, wherein the state graph is configured to generate the plot in a virtual scenario by a specified engine, and the timing relationship between the state nodes in the state graph represents a sequence in which the specified engine executes the state nodes.
displaying an editing interface, wherein the editing interface is configured to provide a plot editing function and comprises candidate state nodes indicating a plot development state of a plot;
determining at least two target state nodes in response to receiving a configure operation on the candidate state nodes;
receiving a timing relationship establish operation for at least two target state nodes, wherein the timing relationship establish operation is for configuring a timing relationship between the state nodes; and
displaying a state graph comprising the at least two target state nodes in the editing interface based on the timing relationship establish operation, wherein the state graph is configured to generate the plot in a virtual scenario by a specified engine, and the timing relationship between the state nodes in the state graph represents a sequence in which the specified engine executes the state nodes.
The method according to claim 1 , wherein each of the at least two target state nodes comprises a node entry pin and a node exit pin, the node entry pin being configured to be connected to a state node previous to the target state node, the node exit pin being configured to be connected to a state node next to the target state node; and receiving the timing relationship establish operation for the at least two target state nodes comprises: receiving a node connect operation between the node exit pin of an i th target state node and the node entry pin of a j th target state node, i and j being positive integers; and establishing the timing relationship between the i th target state node and the j th target state node based on the node connect operation.
receiving the timing relationship establish operation for the at least two target state nodes comprises:
receiving a node connect operation between the node exit pin of an i th target state node and the node entry pin of a j th target state node, i and j being positive integers; and
establishing the timing relationship between the i th target state node and the j th target state node based on the node connect operation.
The method according to claim 2 , wherein the state graph further comprises a start node corresponding to a start pin and an end node corresponding to an end pin, the start node being configured to mark a start position of the plot corresponding to the state graph, and the end node being configured to mark an end position of the plot corresponding to the state graph; and the method further comprises: receiving a connect operation between the start pin of the start node and the node entry pin of an m th target state node; and receiving a connect operation between the end pin of the end node and the node exit pin of an n th target state node, m and n being positive integers.
the method further comprises:
receiving a connect operation between the start pin of the start node and the node entry pin of an m th target state node; and
receiving a connect operation between the end pin of the end node and the node exit pin of an n th target state node, m and n being positive integers.
The method according to claim 2 , wherein the state graph further comprises a plot state node configured to record a state activation condition of state nodes in the state graph; and the method further comprises: receiving a first connect operation between the node exit pin of the i th target state node and the node entry pin of the plot state node; receiving a second connect operation between the node exit pin of the plot state node and the node entry pin of the j th target state node; and displaying a first state graph based on the first connect operation and the second connect operation, the first state graph comprising the i th target state node, the plot state node, and the j th target state node.
receiving a first connect operation between the node exit pin of the i th target state node and the node entry pin of the plot state node;
receiving a second connect operation between the node exit pin of the plot state node and the node entry pin of the j th target state node; and
displaying a first state graph based on the first connect operation and the second connect operation, the first state graph comprising the i th target state node, the plot state node, and the j th target state node.
The method according to claim 1 , wherein each of the at least two target state nodes comprises an interruption condition pin and an interruption exit pin, the interruption condition pin being configured to be connected to a specified state node, the interruption exit pin being configured to be connected to a state node next to the target state node; and receiving the timing relationship establish operation for the at least two target state nodes comprises: receiving a third connect operation between the interruption condition pin of an i th target state node and a dynamic output pin of the specified state node, the dynamic output pin being configured to output state data recorded by the specified state node; receiving a fourth connect operation between the interruption exit pin of the i th target state node and a node entry pin of an j th target state node, i and j being positive integers; configuring an interruption condition corresponding to the i th target state node based on the third connect operation; and establishing a conditional timing relationship between the i th target state node and the j th target state node based on the fourth connect operation, the conditional timing relationship indicating that the plot is controlled to jump from the i th target state node to the j th target state node in response to state data outputted by the dynamic output pin satisfying the interruption condition.
receiving a third connect operation between the interruption condition pin of an i th target state node and a dynamic output pin of the specified state node, the dynamic output pin being configured to output state data recorded by the specified state node;
receiving a fourth connect operation between the interruption exit pin of the i th target state node and a node entry pin of an j th target state node, i and j being positive integers;
configuring an interruption condition corresponding to the i th target state node based on the third connect operation; and
establishing a conditional timing relationship between the i th target state node and the j th target state node based on the fourth connect operation, the conditional timing relationship indicating that the plot is controlled to jump from the i th target state node to the j th target state node in response to state data outputted by the dynamic output pin satisfying the interruption condition.
The method according to claim 1 , wherein determining the at least two target state nodes in response to receiving the configure operation on the candidate state nodes comprises: displaying a candidate node list in the editing interface in response to receiving a list display operation, the candidate node list being configured to display the candidate state nodes; determining the at least two target state nodes from the candidate state nodes in response to receiving a select operation on the candidate state nodes in the candidate node list; and displaying the at least two state nodes in an editing region of the editing interface.
displaying a candidate node list in the editing interface in response to receiving a list display operation, the candidate node list being configured to display the candidate state nodes;
determining the at least two target state nodes from the candidate state nodes in response to receiving a select operation on the candidate state nodes in the candidate node list; and
displaying the at least two state nodes in an editing region of the editing interface.
The method according to claim 1 , wherein determining the at least two target state nodes in response to receiving the configure operation on the candidate state nodes comprises: displaying an initial state node in an editing region of the editing interface in response to receiving a node layout operation; displaying an attribute setting region corresponding to the initial state node in the editing interface, the attribute setting region being configured to set node information of the initial state node and comprising a node type set control for the state nodes; displaying candidate node types in response to receiving a trigger operation on the node type set control, the candidate node types being in one-to-one correspondence to the candidate state nodes; determining a target node type from the candidate node types in response to receiving a select operation on the candidate node types; and configuring the initial state node as the target state node based on the target node type.
displaying an initial state node in an editing region of the editing interface in response to receiving a node layout operation;
displaying an attribute setting region corresponding to the initial state node in the editing interface, the attribute setting region being configured to set node information of the initial state node and comprising a node type set control for the state nodes;
displaying candidate node types in response to receiving a trigger operation on the node type set control, the candidate node types being in one-to-one correspondence to the candidate state nodes;
determining a target node type from the candidate node types in response to receiving a select operation on the candidate node types; and
configuring the initial state node as the target state node based on the target node type.
The method according to claim 1 , further comprising: configuring node attributes for the target state nodes in response to receiving an attribute set operation on the target state nodes in an attribute setting region corresponding to the target state nodes, the node attributes being configured to indicate node running information of the target state nodes.
configuring node attributes for the target state nodes in response to receiving an attribute set operation on the target state nodes in an attribute setting region corresponding to the target state nodes, the node attributes being configured to indicate node running information of the target state nodes.
The method according to claim 8 , wherein the attribute setting region comprises a pin set control for configuring a connection relationship between the state nodes; and configuring the node attributes for the target state nodes in response to receiving the attribute set operation on the target state nodes from the attribute setting region corresponding to the target state nodes comprises: receiving a pin configure operation on the pin set control in the attribute setting region corresponding to an i th target state node, the pin configure operation corresponding to at least two j th target state nodes, i and j being positive integers, the i th target state node and the j th target state node being different state nodes; and establishing a connection relationship between a first pin of the i th target state node and a second pin of the at least two j th target state nodes; and the method further comprises: displaying a connection result between the i th target state node and the at least two j th target state nodes in an editing region of the editing interface.
configuring the node attributes for the target state nodes in response to receiving the attribute set operation on the target state nodes from the attribute setting region corresponding to the target state nodes comprises:
receiving a pin configure operation on the pin set control in the attribute setting region corresponding to an i th target state node, the pin configure operation corresponding to at least two j th target state nodes, i and j being positive integers, the i th target state node and the j th target state node being different state nodes; and
establishing a connection relationship between a first pin of the i th target state node and a second pin of the at least two j th target state nodes; and
displaying a connection result between the i th target state node and the at least two j th target state nodes in an editing region of the editing interface.
The method according to claim 8 , wherein the attribute setting region comprises a trigger action set control for configuring an action triggered in response to entering or exiting a state corresponding to the state node; and configuring the node attributes for the target state nodes in response to receiving the attribute set operation on the target state nodes from the attribute setting region corresponding to the target state nodes comprises: configuring a target entry action as a state effect-taking condition of the target state nodes in response to receiving an entry action set operation on the action set control in the attribute setting region, the entry action set operation corresponding to the target entry action; and configuring a target exit action as a state failure condition of the target state nodes in response to receiving an exit action set operation on the action set control in the attribute setting region, the exit action set operation corresponding to a target exit action.
configuring a target entry action as a state effect-taking condition of the target state nodes in response to receiving an entry action set operation on the action set control in the attribute setting region, the entry action set operation corresponding to the target entry action; and
configuring a target exit action as a state failure condition of the target state nodes in response to receiving an exit action set operation on the action set control in the attribute setting region, the exit action set operation corresponding to a target exit action.
The method according to claim 1 , further comprising: determining the at least two target state nodes in the state graph, and a node relationship between the at least two target state nodes by parsing the state graph by the specified engine in response to the state graph being inputted to the specified engine; acquiring arithmetic logics corresponding to the at least two target state nodes, and binding the target state nodes to the arithmetic logics; and displaying a virtual screen based on the arithmetic logic corresponding to an i th target state node in response to determining the plot running to the i th target state node.
determining the at least two target state nodes in the state graph, and a node relationship between the at least two target state nodes by parsing the state graph by the specified engine in response to the state graph being inputted to the specified engine;
acquiring arithmetic logics corresponding to the at least two target state nodes, and binding the target state nodes to the arithmetic logics; and
displaying a virtual screen based on the arithmetic logic corresponding to an i th target state node in response to determining the plot running to the i th target state node.
The method according to claim 1 , further comprising: acquiring candidate text content, the candidate text content being configured to describe the plot; determining the at least two target state nodes corresponding to plot elements by recognizing and classifying state switching logics between the plot elements in the candidate text content using a state recognition model, and outputting timing relationship information between the plot elements, the state recognition model being a pre-trained text classification model, the plot elements being configured to characterize events occurring within the plot; generating a state graph corresponding to the plot based on the timing relationship information and the at least two target state nodes.
acquiring candidate text content, the candidate text content being configured to describe the plot;
determining the at least two target state nodes corresponding to plot elements by recognizing and classifying state switching logics between the plot elements in the candidate text content using a state recognition model, and outputting timing relationship information between the plot elements, the state recognition model being a pre-trained text classification model, the plot elements being configured to characterize events occurring within the plot;
generating a state graph corresponding to the plot based on the timing relationship information and the at least two target state nodes.
A computer device, comprising a processor and a memory storing at least one instruction, at least one program, a code set or an instruction set therein, wherein the processor, when loading and executing the at least one instruction, the at least one program, the code set or the instruction set, is caused to perform: displaying an editing interface, the editing interface being configured to provide a plot editing function and comprising candidate state nodes indicating a plot development state of a plot; determining at least two target state nodes in response to receiving a configure operation on the candidate state nodes; receiving a timing relationship establish operation for at least two target state nodes, the timing relationship establish operation being for configuring a timing relationship between the state nodes; and displaying a state graph comprising the at least two target state nodes in the editing interface based on the timing relationship establish operation, the state graph being configured to generate the plot in a virtual scenario by a specified engine, the timing relationship between the state nodes in the state graph representing a sequence in which the specified engine executes the state nodes.
displaying an editing interface, the editing interface being configured to provide a plot editing function and comprising candidate state nodes indicating a plot development state of a plot;
receiving a timing relationship establish operation for at least two target state nodes, the timing relationship establish operation being for configuring a timing relationship between the state nodes; and
displaying a state graph comprising the at least two target state nodes in the editing interface based on the timing relationship establish operation, the state graph being configured to generate the plot in a virtual scenario by a specified engine, the timing relationship between the state nodes in the state graph representing a sequence in which the specified engine executes the state nodes.
The device according to claim 13 , wherein each of the at least two target state nodes comprises a node entry pin and a node exit pin, the node entry pin being configured to be connected to a state node previous to the target state node, the node exit pin being configured to be connected to a state node next to the target state node; and wherein the processor, when loading and executing the at least one instruction, the at least one program, the code set or the instruction s
[Truncated to input limit]