Office Action 1: Non-Final Rejection (2024-10-01)
Rejection types: 101 - Patent-Eligible Subject Matter, 103 - Obviousness

CLAIMS:
CLAIMS

What is claimed is:

1\. A virtual object control method performed by a computer device, and the method comprising:
displaying a virtual object in a virtual scene region of a first level;
in response to a task execution instruction for the virtual object, controlling the virtual object to perform a task corresponding to the first level in the virtual scene region;
when the virtual object completes the task, displaying level identifiers of at least two second levels adjacent to the first level;
in response to an interaction instruction for a target level identifier in the level identifiers of the at least two second levels, controlling the virtual object to perform an interaction operation on the target level identifier; and
when the interaction operation is completed, controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier.
2\. The method according to claim 1, wherein the controlling the virtual object to perform an interaction operation on the target level identifier comprises:
controlling the virtual object to use a shooting prop to shoot a projectile towards the target level identifier, to trigger the interaction operation on the target level identifier; and
determining that the interaction operation is completed when the projectile moves to a position of the target level identifier.
3\. The method according to claim 1, wherein the controlling the virtual object to perform an interaction operation on the target level identifier comprises:
controlling the virtual object to throw a virtual prop towards the target level identifier, to trigger the interaction operation on the target level identifier; and
determining that the interaction operation is completed when the virtual prop moves to a position of the target level identifier.
4\. The method according to claim 1, wherein the controlling the virtual object to perform an interaction operation on the target level identifier comprises: controlling the virtual object to use a virtual prop to perform an attack operation on the target level identifier, the attack operation being used as the interaction operation on the target level identifier; and
determining that the interaction operation is completed when an attack result of the attack operation represents that the target level identifier is attacked successfully.
5\. The method according to claim 1, wherein the displaying level identifiers of at least two second levels adjacent to the first level comprises:
obtaining region information of the virtual scene region corresponding to the first level;
using image elements associated with the region information as the level identifiers of the second levels; and
displaying the image elements in one-to-one correspondence to the second levels in the virtual scene region corresponding to the first level.
6\. The method according to claim 1, wherein the controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier comprises:
displaying a moving path that connects a current position of the virtual object and the virtual scene region of the second level corresponding to the target level identifier;
controlling the virtual object to move along the moving path; and
controlling the virtual object to stop moving when the virtual object moves to the virtual scene region of the corresponding second level along the moving path, so that the virtual object is in a static state in the virtual scene region of the corresponding second level.
7\. The method according to claim 1, wherein the controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier comprises:
obtaining a scene type of the second level corresponding to the target level identifier;
displaying a virtual vehicle adapted to the scene type in the virtual scene region corresponding to the first level; and controlling the virtual object to take the virtual vehicle to move to the virtual scene region of the corresponding second level.
8\. The method according to claim 1, wherein the controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier comprises:
obtaining a character type corresponding to the virtual object; and
controlling the virtual object to move to the virtual scene region of the second level corresponding to the target level identifier in a moving manner adapted to the character type.
9\. The method according to claim 1, further comprising:
obtaining a score associated with the task when the virtual object completes the task;
and displaying a moving effect corresponding to the score when the virtual object moves to the virtual scene region of the second level corresponding to the target level identifier.

10\. The method according to claim 1, wherein the method further comprises:
when the interaction operation is not completed, randomly selecting one second level from a plurality of second levels, and controlling the virtual object to move to a virtual scene region of the randomly selected second level; or
initializing the task of the virtual object for the first level, so that the virtual object performs the task corresponding to the first level again.

11\. The method according to claim 1, wherein the virtual scene region corresponding to the first level comprises at least one target object interacting with the virtual object; and
the controlling the virtual object to perform a task corresponding to the first level in the virtual scene region comprises:
controlling the virtual object to attack the target object in the virtual scene region;
determining, when the target object is attacked, that a health value of the target object is reduced; and
determining, when the health value of the target object is reduced to zero, that the virtual object completes the task corresponding to the first level.
12\. A computer device, comprising:
a memory, configured to store executable instructions; and
a processor, configured to perform a virtual object control method when executing the executable instructions stored in the memory, the method including:
displaying a virtual object in a virtual scene region of a first level;
in response to a task execution instruction for the virtual object, controlling the virtual object to perform a task corresponding to the first level in the virtual scene region;
when the virtual object completes the task, displaying level identifiers of at least two second levels adjacent to the first level;
in response to an interaction instruction for a target level identifier in the level identifiers of the at least two second levels, controlling the virtual object to perform an interaction operation on the target level identifier; and
when the interaction operation is completed, controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier.

13\. The computer device according to claim 12, wherein the controlling the virtual object to perform an interaction operation on the target level identifier comprises:
controlling the virtual object to use a shooting prop to shoot a projectile towards the target level identifier, to trigger the interaction operation on the target level identifier; and
determining that the interaction operation is completed when the projectile moves to a position of the target level identifier.

14\. The computer device according to claim 12, wherein the controlling the virtual object to perform an interaction operation on the target level identifier comprises:
controlling the virtual object to throw a virtual prop towards the target level identifier, to trigger the interaction operation on the target level identifier; and
determining that the interaction operation is completed when the virtual prop moves to a position of the target level identifier.

15\. The computer device according to claim 12, wherein the controlling the virtual object to perform an interaction operation on the target level identifier comprises: controlling the virtual object to use a virtual prop to perform an attack operation on the target level identifier, the attack operation being used as the interaction operation on the target level identifier; and
determining that the interaction operation is completed when an attack result of the attack operation represents that the target level identifier is attacked successfully.

16\. The computer device according to claim 12, wherein the displaying level identifiers of at least two second levels adjacent to the first level comprises:
obtaining region information of the virtual scene region corresponding to the first level;
using image elements associated with the region information as the level identifiers of the second levels; and
displaying the image elements in one-to-one correspondence to the second levels in the virtual scene region corresponding to the first level.

17\. The computer device according to claim 12, wherein the controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier comprises:
displaying a moving path that connects a current position of the virtual object and the virtual scene region of the second level corresponding to the target level identifier;
controlling the virtual object to move along the moving path; and
controlling the virtual object to stop moving when the virtual object moves to the virtual scene region of the corresponding second level along the moving path, so that the virtual object is in a static state in the virtual scene region of the corresponding second level.

18\. The computer device according to claim 12, wherein the controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier comprises:
obtaining a scene type of the second level corresponding to the target level identifier;
displaying a virtual vehicle adapted to the scene type in the virtual scene region corresponding to the first level; and controlling the virtual object to take the virtual vehicle to move to the virtual scene region of the corresponding second level.

19\. The computer device according to claim 12, wherein the method further comprises:
when the interaction operation is not completed, randomly selecting one second level from a plurality of second levels, and controlling the virtual object to move to a virtual scene region of the randomly selected second level; or
initializing the task of the virtual object for the first level, so that the virtual object performs the task corresponding to the first level again.

20\. A non-transitory computer-readable storage medium, storing executable instructions, the executable instructions, when executed by a processor of a computer device, causing the computer device to implement a virtual object control method including:
displaying a virtual object in a virtual scene region of a first level;
in response to a task execution instruction for the virtual object, controlling the virtual object to perform a task corresponding to the first level in the virtual scene region;
when the virtual object completes the task, displaying level identifiers of at least two second levels adjacent to the first level;
in response to an interaction instruction for a target level identifier in the level identifiers of the at least two second levels, controlling the virtual object to perform an interaction operation on the target level identifier; and
when the interaction operation is completed, controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier. 031384-7505-US33 031384-7505-US34 031384-7505-US35 031384-7505-US36 031384-7505-US37 031384-7505-US38

OFFICE ACTION:
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, 12, and 20, 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, a device, 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 virtual object control method performed by a computer device, and the method comprising: (processing data according to the rules of a game)
displaying a virtual object in a virtual scene region of a first level; in response to a task execution instruction for the virtual object, controlling the virtual object to perform a task corresponding to the first level in the virtual scene region; (processing data according to the rules of a game, displaying the output to a player)
when the virtual object completes the task, displaying level identifiers of at least two second levels adjacent to the first level; (processing data according to the rules of a game, displaying the output to a player)
in response to an interaction instruction for a target level identifier in the level identifiers of the at least two second levels, controlling the virtual object to perform an interaction operation on the target level identifier; and (processing data according to the rules of a game, displaying the output to a player)
when the interaction operation is completed, controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier. (processing data according to the rules of a game, displaying the output to a player)
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 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 § 103
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 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows:
1. Determining the scope and contents of the prior art.
2. Ascertaining the differences between the prior art and the claims at issue.
3. Resolving the level of ordinary skill in the pertinent art.
4. Considering objective evidence present in the application indicating obviousness or nonobviousness.
Claim(s) 1 to 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Zhang (Chinese patent publication CN 112717386 A) in view of Luo, et al. (Chinese patent publication CN 108421255 A) (both cited on the IDS).
As to Claims 1 to 20: Zhang is the prior art document closest to independent claims | and 18. Zhang discloses a method for controlling a game virtual character (see description, Paras. 49 to 160, Figs. 1, 4, 6, & 7): a landscape level picture is displayed, the landscape level picture displaying a virtual character located at a first sub-level; a user can control the virtual character to move or attack in the first sub-level; in response to the virtual character passing through the settlement position of the first sub-level, settlement information of the first sub-level is displayed by means of display information or pop-up prompt information on the landscape level picture; the virtual character is controlled to continue moving until the virtual character moves to a second sub-level, and when the user operates the virtual character to enter the second sub-level from the first sub-level, there is no loading switching process in a traditional level switching process.  Zhang Claims 1 to 3: “1. A display method of checkpoint picture, applied to the client, wherein the checkpoint provided by the client comprises at least two sub-checkpoints, the method comprises: displaying the transverse board closing picture; the transverse board closing picture displays the virtual role located at the first sub-closing card; in response to the mobile operation, controlling the virtual role to move in the first sub-card; in response to the virtual role in the first sub-card moving to the trigger position of the second sub-card, loading the second sub-card; controlling the virtual role to move from the first sub-card to the second sub-card.  2. The method according to claim 1, wherein the triggering position of the second sub-card is the settlement position of the first sub-card. the control of the virtual role to move from the first sub-card to the second sub-card, comprising: responding to the settlement position of the virtual role passing through the first sub-card, displaying the settlement information of the first sub-card on the cross-board card-closing picture; controlling the virtual character to keep moving, until to the second sub-card.  3. The method according to claim 2, wherein the step of responding to the settlement position of the virtual role passing through the first sub-card, displaying the settlement information of the first sub-card on the cross-board card-closing picture, comprising: responding to the settlement position of the virtual role passing through the first sub-card, using head-up display information or pop-up prompt information to display the settlement information of the first sub-card on the cross-board card-closing picture.”  Zhang abstract: “The invention claims a display method of checkpoint picture, device, device and storage medium, belonging to the field. Application to the client, the gateway provided by the client comprises at least two sub-card, the method comprises: displaying the transverse plate closing image; the transverse plate closing image is displayed with a virtual role located at the first sub-closing card; in response to the mobile operation, controlling the virtual role to move in the first sub-card; responding to the virtual role to move to the trigger position of the second sub-card in the first sub-card, loading the second sub-card; The virtual role is controlled to move from the first sub-card to the second sub-card. The invention makes the terminal only load the card resource of part of the card in the operation process, without loading all the card resource of the whole card at the same time, so as to reduce the high requirement of the calculation performance and cache resource of the mobile terminal.”
The present claims differ from Zhang by: when there are at least two second levels adjacent to a first level, displaying a level identifier of each second level, in response to an interaction instruction for a target level identifier, controlling a virtual object to execute an interaction operation on the target level identifier, and entering a virtual scene area of a second level corresponding to the target level identifier.  With regard to the described differences between the present claims and Zhang, Luo, the secondary reference, discloses a scene image display method, and specifically discloses (see description, Paras. 95 & 96, Figs. 7 & 9): a second event can be detected while or after a first part of scene is displayed on a target client, the second event being used for selecting second identifiers in entry identifiers; in response to the second event, a picture of a target virtual scene is displayed on the target client, wherein the target virtual scene is a virtual scene represented by the second identifiers in a plurality of virtual scenes, and it can be seen from Figs. 7 and 9 that the number of the second identifiers is greater than one.  This modification would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention; such a modification would have the advantage of allowing the player to go to a choice of more than one second level when the task is completed, giving the player some control over the sequence of game play.  Some of the additional technical features of the claims are disclosed in Zhang or Luo: using image elements associated with region information as the level identifier of the second level, obtaining a score, and directly entering the second switch when only one second level exists.  Moreover, the undisclosed specific operation mode of a target identifier, information viewing, indication of a movement path, transition between levels, determination of the completion of the task of the level, map viewing function, etc. are all conventional technical means in the art.
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 to 8, 11 to 18, and 20 to 23 (independent Claims 1, 12, and 20, 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 Zhang (Chinese patent publication CN112717386 A, cited on the IDS and the ISR for the parent PCT case).  Zhang discloses controlling a game virtual character (Paras. 49 to 160, Figs. 1, 4, 6, & 7) comprising: a landscape level picture is displayed, the landscape level picture displaying a virtual character located at a first sub-level; a user can control the virtual character to move or attack in the first sub-level; in response to the virtual character passing through the settlement position of the first sub-level, settlement information of the first sub-level is displayed by means of display information or pop-up prompt information on the landscape level picture; the virtual character is controlled to continue moving until the virtual character moves to a second sub-level, and when the user operates the virtual character to enter the second sub-level from the first sub-level, there is no loading switching process in a traditional level switching process.  See especially Claims 1 to 3 and Abst. of Zhang.  Zhang does not suggest distinguishing the two second levels on conjunction with the rest of the limitations as claimed.
The present claims pertain to: “a virtual object control method performed by a computer device, and the method comprising: displaying a virtual object in a virtual scene region of a first level; in response to a task execution instruction for the virtual object, controlling the virtual object to perform a task corresponding to the first level in the virtual scene region; when the virtual object completes the task, displaying level identifiers of at least two second levels adjacent to the first level; in response to an interaction instruction for a target level identifier in the level identifiers of the at least two second levels, controlling the virtual object to perform an interaction operation on the target level identifier; when the interaction operation is completed, controlling the virtual object to move to a virtual scene region of a second level corresponding to the target level identifier; obtaining a score associated with the task when the virtual object completes the task; displaying an automatic movement of the virtual object to the virtual scene region of the second level corresponding to the target level identifier; and displaying a moving effect corresponding to the score in parallel to the movement of the virtual object; when the interaction operation is not completed, randomly selecting one second level from a plurality of second levels; and displaying an automatic movement of the virtual object to a virtual scene region of the randomly selected second level.”  In the typical prior art games, after a task of a level in a virtual scene is completed, a level selection interface is generally displayed, and a user triggers a selection operation of a level based on the level selection interface, and then a virtual scene picture of the level corresponding to the selection operation is displayed.  Due to the need for a page jump, the consistency between levels is poor, and image display resources and computing resources are wasted.  The present claims have the overall advantage of implementing selection of levels in an efficient manner with low resource consumption.  The examiner respects that the applicant 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 US5970479A: Claims:
I claim: 1. A computer-based data processing system to enable the formulation of customized multi-party risk management contracts having a future time of maturity, the system comprising:at least one stakeholder input means by which ordering stakeholders can input contract data representing at least one offered contract in at least one predetermined phenomenon, each said phenomenon having a range of future outcomes, and said contract data specifying entitlements due at maturity for said range of future outcomes, and a consideration due to a counter-party stakeholder; at least one counter-party stakeholder input means by which at least one counter-party stakeholder can input registering data, independent of said stakeholder entering said contract data, as to a likelihood of each outcome in said range of future outcomes for one or more of said predetermined phenomena; a data storage means linked with each said stakeholder input means and linked with each said counter-party stakeholder input means to store said contract data and said registering data; and data processing means, linked with the data storage means, for pricing and matching contracts from said contract data and said registering data, said pricing including calculating a counter-consideration derived from said likelihoods and said entitlements, and said matching including comparing said consideration and said counter-consideration to match an offered contract with at least one of said counter-party stakeholders. 2. The system as in claim 1, further comprising at least one other-stakeholder input means linked with the data storage means, and by which phenomena and associated range of outcomes can be input to be stored in the data storage means to be ones of said predetermined phenomena and said range of future outcomes therefor. 3. The system as in claim 2, wherein each other-stakeholder input means is configured so that each said predetermined phenomenon and associated range of future outcomes further include a predetermined time of maturity, and said contract data and said registering data are for the time of maturity. 4. The system as in claim 2 or claim 3, wherein said registering data for each outcome represents a probability of that outcome eventuating at the time of maturity, and said counter-consideration is calculated by elemental multiplication of entitlements and the respective likelihood, all summed over the range, and adjusted at least to calculate the present day value thereof. 5. The system as in claim 4, wherein the said other-stakeholder input means is configured to receive updating data as to a present day outcome of each of the phenomena, in turn to be passed to the data storage means for recordal. 6. The system as in claim 5, wherein, on maturity of the contract, the data processing means retrieves the updated present day outcome of the respective phenomenon from the data storage means, determines an entitlement due for that outcome, and passes the entitlement to output means of the data processing system for exchange of the entitlement between the matched stakeholders. 7. The system as in claim 6, wherein said output means is linked with data communications means to remote locations where stakeholder accounts reside, and the data processing means causes transaction of the entitlement between respective stakeholder accounts. 8. The system as in claim 4, wherein said other-stakeholder input means receives qualification data which places qualification on which of the counter-party registering data can be used to price and/or match an offered contract, the said qualification data being stored in the data storage means. 9. The system as in claim 8, wherein said qualification data is input to the input means by parties including stakeholder guarantors, and financial or institutional regulators. 10. The system as in claim 4, wherein the data processing means is configured so that a match of an offered contract is made on the basis only of a counter-consideration being less than or equal to the said consideration. 11. The system as in claim 10, wherein the data processing means is configured so that a match of an offered contract is made with a preferred one of a counter-consideration being less than or equal to the said consideration. 12. The system as in claim 4, further comprising a credit record and a debit record for each stakeholder held with an exchange Institution, the credit records and debit records for exchange of entitlements; and the data storage means of the data processing apparatus being configured to include a shadow credit record and a shadow debit record for each stakeholder, the data processing means being configured to obtain a start-of-day balance for each shadow credit record and shadow debit record, and for every transaction resulting in an exchange obligation, adjusting the respective shadow credit record or shadow debit record, allowing only those 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 the data processing means further being configured to, at the end-of-day, instruct ones of the exchange institutions to exchange transacted credits or debits to the credit record and debit record of the respective stakeholders in accordance with the adjustments of the said permitted transactions, the credits and debits be Irrevocable, time invariant obligations placed on the exchange institutions. 13. The system as in claim 1, wherein, on a match of an offered contract, the data processing means passes the matched contract to the data storage means for recordal. 14. The system as in claim 13, wherein the output means generates confirmatory documentation for each stakeholder to a matched contract. 15. The computer-based data processing system of claim 1, further includes a second counter party stakeholder input means by which a second counter-party stakeholder can input registering data. 16. A system to enable the formulation of customized multi-party risk management contracts, the system comprising:a plurality of main data processing devices interconnected by at least one data communications link, each said data processing device running an operating system and applications software; one or more data storage devices to which each data processing device has access; a plurality of data input/output channels providing connection to a plurality of stakeholder locations, each said location having data processing means, and the system being programmed for:regulating input of data, specifying a risk phenomenon, a range of outcomes for the phenomenon, and a time of maturity; stakeholders inputting to a said data storage device by ones of the stakeholder data processing locations contract data for an offered contract, specifying an entitlement due at maturity for each outcome in the range of outcomes for a one of the predetermined phenomena, and an amount payable to a seller; counter-party stakeholders inputting to a data storage device by ones of the stakeholder data processing locations registering data, independent of contract data entered by stakeholders, as to a likelihood of occurrence of each outcome in the range of outcomes for at least one of the predetermined phenomena; pricing and matching a contract by the main data processing devices for at least one of the offered contracts from the seller registered data by: for an offered contract, selecting the registering data for the respective phenomenon and, in response to entitlements specified for each outcome in the range of outcomes for the phenomenon, calculating a counter-consideration, and, by comparison of the calculated counter-consideration with the consideration, matching an offered contract with at least one counter-party stakeholder. 17. The system as in claim 16, further comprising output means for each distributed data processing location whereby, on a match of a contract, confirmation is output in the form of data or documentation to respective output means for the matched stakeholders. 18. A method to enable the formulation of customized multi-party risk management contracts having a future time of maturity, the method comprising the steps of:(a) inputting into data processing apparatus, by at least one ordering stakeholder input means thereof, contract data representing at least one offered contract in at least one predetermined phenomenon having a range of future outcomes, and said contract data specifying entitlements due at maturity for the range of future outcomes, and consideration due to a counter-party stakeholder; (b) inputting into said data processing apparatus, by at least one counter-party stakeholder input means thereof, counter-party registering data, independent of at least one ordering stakeholder entering contract data, as to a likelihood of each outcome in said range of future outcomes for one or more of said predetermined phenomena; (c) storing, in a data storage means of said data processing apparatus linked with each said stakeholder input means and linked with each said counter-party stakeholder input means, said contract data and said registering data; and (d) pricing and matching at least one of the offered contracts by data processing means of the data processing apparatus linked with said data storage means, said pricing and matching comprising the steps, for each offered contract, of:(i) calculating a counter-consideration derived from said likelihoods and said entitlements; (ii) comparing said consideration and said counter-consideration; and (iii) matching a contract on the basis of said comparison. 19. The method as in claim 18, comprising the further step, before step (a), of:(aa) inputting into said data processing apparatus, by at least one other other-stakeholder Input means thereof, predetermining data of a said phenomenon and an associated range of outcomes. 20. The method as in claim 19, wherein the step (at) further comprises inputting a predetermined time of maturity for each predetermined phenomenon and associated range of outcomes. 21. The method as in claim 20, wherein the registering data for each outcome represents a likelihood of that outcome eventuating at the time of maturity, and the step (d)(i) is performed bymultiplying elemental entitlements for each outcome with the respective likelihood; summing the products for the range of outcomes; and adjusting the sum at least to calculate a present day value thereof to give the counter-party consideration. 22. The method as in claim 21, comprising the further steps, following step (d), of:(h) inputting, by the other-stakeholder input means, qualification data on which of the counter-party registering data can be used to price an offered contract. 23. The method as in claim 21, wherein the step (d)(iii) is performed by considering those counter-considerations being only less than or equal to said consideration. 24. The method as in claim 23, wherein the step (d)(iv) is performed by matching a preferred one of the counter-considerations being less than or equal to the said consideration. 25. The method as in claim 19, comprising the further step following step (d) of:(e) inputting, by the other-stakeholder input means, data representing a present day outcome of each phenomenon. 26. The method as in claim 25, comprising the further steps, following step (e) of, at the time of maturity:(f) calculating the entitlement for the updated present day outcome; and (g) exchanging the entitlement between matched stakeholders. 27. The method as in claim 18 or claim 19 comprising the further step, following step (d), and before the time of maturity, of:(m) a party to a matched contract offering a stake in the contract to other parties in exchange for a consideration, and, on acceptance of the stake and exchange of the consideration by another party, that other party becoming a stakeholder to the contract. 28. The method as in claim 18, wherein each stakeholder holds a credit record and a debit record with an exchange institution, the credit record and debit record for exchange of entitlements, the method comprising the further steps, following step (d), of:(i) creating a shadow credit record and a shadow debit record for each stakeholder to be held independently by the data processing apparatus from the exchange institutions; (j) obtaining from each exchange institution a start-of-day balance for each shadow credit record and shadow debit record; (k) for every translation resulting In an exchange obligation, the supervisory institution adjusting each respective shadow credit record or shadow debit record, allowing only those 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 (l) at the end-of-day, the data processing apparatus instructing ones of the exchange institutions to exchange transacted credits or debits to the credit record and debit record of the respective stakeholders in accordance with the adjustments of the said permitted transactions, the credits and debits being irrevocable, time invariant obligations placed on the exchange institutions. 29. The method as in claim 28, wherein the end-of-day instructions represent credits and debits netted throughout the day for each stakeholder in respect of all the transactions of that day. 30. The method as in claim 18, comprising the further step following step (d) of:(n) passing matched contracts to the data storage means for recordal. 31. The method as in claim 30, comprising the further step following step (n) of:(o) generating confirmatory documentation for each stakeholder for each matched contract. 32. A method of making a computer system, the method comprising the steps of:(a) interconnecting at least one stakeholder data input means and at least one counter-stakeholder data input means to data storage means; (b) interconnecting the data storage means with data processing means; (c) interconnecting the data processing means with output means; and (d) programming the data processing means to:(i) accept stakeholder input data of contract data representing at least one offered contract, each offered contract specifying a predetermined phenomenon, each phenomenon having a range of future outcomes, and each said contract data having a future time of maturity, an entitlement due for each outcome in said range of outcomes, and a consideration payable to a counter-party stakeholder; (ii) accept counter-stakeholder registering data, independent of said stakeholder input data being accepted, as to a likelihood of each outcome in said range of future outcomes for each one or more of said phenomena; (iii) process the contract data and the registering data to price and match a contract, said pricing including: selecting the registering data corresponding to the time of maturity for each predetermined phenomenon, and calculating a counter-consideration derived from said entitlements and said likelihoods; and said matching including comparing said consideration and said counter-consideration to match an offered contract with at least one of said counter-party stakeholders; and (iv) output confirmatory data or documentation for each matched contract. 33. 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 ones 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. 34. The method as in claim 33, wherein the end-of-day instructions represent credits and debits netted throughout the day for each party in respect of all the transactions of that day. 35. A data processing system to enable the formulation of customized multi-party risk management contracts, the system comprising:at least one stakeholder input means by which ordering stakeholders can input contract data representing at least one offered contract in at least one predetermined phenomenon, each said phenomenon having a future outcome at a time of maturity, and said contract data specifying an entitlement due at maturity for each outcome in a range of future outcomes; at least one counter-party stakeholder input means by which at least one counter-party stakeholder can input registering data, independent of said stakeholders inputting said contract data, for one or more of said predetermined phenomena; a data storage means linked with each said stakeholder input means and linked with each said counter-party stakeholder input means to store said contract data and said registering data; and data processing means, linked with the data storage means, for pricing and matching contracts from said contract data and said registering data, said pricing including calculating counter-considerations derived from said registering data relating to the phenomenon of the contract data, and said matching including comparing said counter-considerations to match an offered contract with at least one of said counter-party stakeholders. 36. A data processing system to enable the formulation of customized potential multi-party risk management contracts, the system comprising:at least one stakeholder input means by which ordering stakeholders can input contract data representing at least one offered contract in at least one predetermined phenomenon, each said phenomenon having a future outcome at a time of maturity, and said contract data specifying an entitlement due at maturity for each outcome in a range of future outcomes; at least one counter-party stakeholder input means by which at least one counter-party stakeholder can input registering data, independent of said stakeholders inputting said contract data, for one or more of said predetermined phenomena; a data storage means linked with each said stakeholder input means and linked with each s aid counter-party stakeholder input means to store said contract data and said registering data; and data processing means, linked with the data storage means, for pricing contracts from said contract data and said registering data, said pricing including calculating counter-considerations derived from said registering data relating to the phenomenon of the contract data. 37. A data-processing system to enable the formulation of customized multi-party risk management contracts, the system comprising:at least one stakeholder input means by which ordering stakeholders can input contract data representing at least one offered contract in at least one predetermined phenomenon, each said phenomenon having a future outcome at a time of maturity, and said contract data specifying an entitlement due at maturity for each outcome in a range of future outcomes; at least one counte
[Truncated to input limit]