Office Action 2: Notice of Allowance (2025-03-04)

CLAIMS:
AMENDMENTS TO THE CLAIMS

This listing of claims will replace all prior versions and listings of claims in the application:

1\. (Currently Amended) 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 \[\[a\]\] 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;\[\[and\]\] 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.

2\. (Cancelled)

3\. (Currently Amended) The method according to claim \[\[2\]\]1, 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\. (Original) 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\. (Original) 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\. (Original) 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\. (Original) 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\. (Original) 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\. (Original) 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\. (Currently Amended) The method according to claim 3, wherein :
 the determination node is associated with a plot parameter determination.

11\. (Cancelled)

12\. (Currently Amended) 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 :

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 \[\[a\]\] 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 asuperior-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;\[\[and\]\] 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.

13\. (Cancelled)

14\. (Original) 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\. (Currently Amended) 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 processor is further configured to implement :
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\. (Original) 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\. (Original) 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\. (Original) 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\. (Original) 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\. (Original) 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; andwhen the replacing spliced path does not conform to the plot logic rule, checking the parameter modification on the next path interval.

21\. (New) An electronic device comprising:
one or more processors; and
a storage apparatus storing one or more programs that, when executed by the one or more processors, cause the one or more processors to implement:
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.

22\. (New) The device according to claim 21, 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.

23\. (New) The device according to claim 22, 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
Application No. 17962848 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.

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

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


CITED REFERENCE SUMMARIES: Ref CN109794064A: Claims:
1. a kind of interaction plot implementation method characterized by comprising
Show game scenario structural interface, the game scenario structural interface include several players entered game can be read
Plot block, each game scenario block correspond to one or more game scenario, and game scenario block each can be read and be stored with game
Plot path data；
Receive the plot skip instruction that player is triggered by the game scenario structural interface；
Take-off game scenario block is determined according to the plot skip instruction and needs the target jumped to that game scenario block can be read,
The target can be read game scenario block and be stored with the target game plot path data including target game plot path；
When the take-off game scenario block is located on target game plot path, determine that the take-off game scenario block is deposited
The take-off game scenario path data of storage, with the target game plot path data on game logic whether access；
If access, the target game plot path data is updated according to the take-off game scenario path data；
Entering the target according to updated target game plot path data can be read the corresponding game play of game scenario block
Feelings.
2. interaction plot implementation method according to claim 1, which is characterized in that the take-off game scenario path data
Including take-off game logic parameter；The target game plot path data further includes target game logic parameter；
Determine the take-off game scenario path data and the target game plot number of path that the take-off game scenario block stores
According on game logic whether access, comprising:
The take-off game logic parameter is compared with target game logic parameter, obtains comparing result；
Determine that the take-off game logic parameter and target game logic parameter are on game logic according to the comparing result
No intercommunication；
If intercommunication, it is determined that the take-off game scenario path data and the target game plot path data are in game logic
Upper access.
3. interaction plot implementation method according to claim 2, which is characterized in that the take-off game logic parameter includes
Player reaches player parameter when take-off game scenario block, and the target game logic parameter includes the player ginseng
The corresponding parameter decision of number；
The take-off game logic parameter is compared with target game logic parameter, comprising:
The player parameter is compared with the parameter decision, to determine whether player parameter meets the ginseng
Number determines.
4. interaction plot implementation method according to claim 1, which is characterized in that when the take-off game scenario block is located at
When on target game plot path, determine take-off game scenario block storage take-off game scenario path data, with
The target game plot path data on game logic whether access, comprising:
It seeks common ground to target game plot path and take-off game scenario path, obtains intersection game scenario block；
When the intersection game scenario block is take-off game scenario block, determine that the take-off game scenario block is located at the target
On game scenario path；
Determine the take-off game scenario path data and the target game plot number of path that the take-off game scenario block stores
According on game logic whether access.
5. interaction plot implementation method according to claim 1, which is characterized in that according to take-off game scenario path
Data are updated the target game plot path data, comprising:
It is acute that target game is reached according to the take-off game scenario path data and target game plot path data building
The new game plot path data of feelings block；
Target game plot path data is updated according to the new game plot path data.
6. interaction plot implementation method according to claim 5, which is characterized in that the take-off game scenario path data
Including take-off game scenario path, take-off game logic parameter；The target game plot path data further includes target game
Logic parameter；
It is acute that target game is reached according to the take-off game scenario path data and target game plot path data building
The new game plot path data of feelings block, comprising:
The new game plot of target game plot block is reached according to take-off game scenario path and target game plot path construction
Path；
Take-off game logic parameter is inherited on the basis of target game logic parameter, obtains new game logic parameter.
7. interaction plot implementation method according to claim 1, which is characterized in that further include:
When the take-off game scenario block is located on target game plot path, according to target game plot path
Data, which enter the target, can be read the corresponding game scenario of game scenario block.
8. interaction plot implementation method according to claim 1, which is characterized in that further include
When determining take-off game scenario path data and target game plot path data not access on game logic,
Entering the target according to the target game plot path data can be read the corresponding game scenario of game scenario block.
9. interaction plot implementation method according to claim 1, which is characterized in that display game scenario structural interface, packet
It includes:
Receive the plot structure idsplay order that player is triggered by interface；
Display game scenario structural interface is returned according to the plot structure idsplay order.
10. interaction plot implementation method according to claim 1, which is characterized in that display game scenario structural interface, packet
It includes:
When receiving plot structure idsplay order, reads going game plot path and read from game scenario block can be read
Player is taken to reach the historical game play plot path that game scenario block can be read；
Going game plot path and historical game play plot path are drawn in game scenario structural interface；
Game scenario structural interface after display drafting.
11. interaction plot implementation method according to claim 10, which is characterized in that drawn in game scenario structural interface
Going game plot path and historical game play plot path, comprising:
Using the first lines by the game scenario block on going game plot path in the game scenario structural interface
Series connection；
Using the second lines by the game scenario block on historical game play plot path in the game scenario structural interface
Series connection.
12. interaction plot implementation method according to claim 1, which is characterized in that wherein, game scenario structure circle
Game scenario block in face shows plot summary info.
13. interaction plot implementation method according to claim 1, which is characterized in that the game scenario structural interface is also
Show the current game progress information of player.
14. interaction plot implementation method according to claim 1, which is characterized in that further include: in game process, when
Into when the corresponding game scenario of game scenario block can be read, based on current player reach described in the trip of game scenario block can be read
The game scenario path data that game scenario block stores can be read described in updating in drama feelings path data.
15. a kind of interaction plot realization device characterized by comprising
Display unit, for showing that game scenario structural interface, the game scenario structural interface include that several players have entered
That crosses can be read game scenario block, and each game scenario block corresponds to one or more game scenario, and game play each can be read
Feelings block is stored with game scenario path data；
Instruction receiving unit, the plot skip instruction triggered for receiving player by the game scenario structural interface；
Plot block determination unit, the mesh for determining take-off game scenario block according to the plot skip instruction and needing to jump to
Game scenario block can be read in mark, and the target can be read game scenario block and be stored with the target trip including target game plot path
Drama feelings path data；
Data path determination unit is used for when the take-off game scenario block is located on target game plot path, really
The take-off game scenario path data of the fixed take-off game scenario block storage is being swum with the target game plot path data
Play in logic whether access；
Updating unit determines the take-off game scenario path data and the target for the data path determination unit
Game scenario path data is in access on game logic, according to the take-off game scenario path data to the target game
Plot path data is updated；
Game play can be read for entering the target according to updated target game plot path data in plot processing unit
The corresponding game scenario of feelings block.
16. a kind of storage medium, which is characterized in that the storage medium is stored with a plurality of instruction, and described instruction is suitable for processor
It is loaded, the step in 1 to 14 described in any item interaction plot implementation methods is required with perform claim.
17. a kind of terminal, which is characterized in that including processor and memory, the memory is stored with a plurality of instruction；The place
Reason device loads instruction from the memory, to execute as in the described in any item interaction plot implementation methods of claim 1-14
The step of.