Prosecution Insights
Last updated: May 29, 2026
Application No. 17/896,649

SYSTEM AND METHOD FOR SUPPORTING CREATION OF GAME SCRIPT

Non-Final OA §101§103
Filed
Aug 26, 2022
Priority
Feb 28, 2020 — JP 2020-033989 +1 more
Examiner
HICKS, AUSTIN JAMES
Art Unit
2142
Tech Center
2100 — Computer Architecture & Software
Assignee
Cygames Inc.
OA Round
1 (Non-Final)
75%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
310 granted / 411 resolved
+20.4% vs TC avg
Strong +25% interview lift
Without
With
+24.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
30 currently pending
Career history
462
Total Applications
across all art units

Statute-Specific Performance

§101
3.8%
-36.2% vs TC avg
§103
82.6%
+42.6% vs TC avg
§102
9.1%
-30.9% vs TC avg
§112
3.9%
-36.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 411 resolved cases

Office Action

§101 §103
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 . Election/Restrictions Applicant’s election without traverse of claims 10-13 in the reply filed on 3/11/2026 is acknowledged. 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 10-13 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea of a mental concept without significantly more. The claims recite accepting text, inferring control text from the text, and post processing to convert control text to control data. This judicial exception is not integrated into a practical application because it is only linked to computers. The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception because the computer readable media is generic computer part. Claim Rejections - 35 USC § 103 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. Claims 10-13 are rejected under 35 U.S.C. 103 as being unpatentable over US20080300053A1 to Muller and Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer by Raffel et al. Muller teaches claims 10, 12 and 13. A system (Muller para 17) for supporting the creation of a game script including natural language data representing explanation text in a game and also including control data for controlling the game, the natural language data and the control data being associated in accordance with the content of the game, the system comprising: (Muller abs “Input from a text editor containing lines of text of a script is received, commands to control objects in a simulation are identified in the lines of text in the editor, a state of the simulation is updated in accordance with the input and the commands…”) an input acceptance unit that accepts the input of explanation text in the game; and: (Muller abs “Input from a text editor containing lines of text of a script is received…”) an inference unit that infers, (Muller abs “Input from a text editor containing lines of text of a script is received, commands to control objects in a simulation are identified in the lines of text in the editor, a state of the simulation is updated in accordance with the input and the commands…”) (Muller abs “text of a script”) and control explanation text in the form of natural language data created from control data corresponding to the explanation text. (Muller abs “commands to control objects in a simulation are identified in the lines of text in the editor…”) Muller doesn’t teach a trained NLP engine. However, Raffel teaches using a trained model… the trained model being generated by causing a pre-trained natural language model to learn processed (Applicant’s “advance grammatical structures” is not a term of art and is not defined in a rigorous way to mean something other than generic NLP. This text-to-text training is taught by the drop-out training of Raffel sec. 3.1.4 and fig. 2. Using the trained model is taught in fig. 2 as a table of average and standard deviation scores of the trained models on different tasks and using different training methods.) Muller, Raffel and the claims are all directed to processing text. It would have been obvious to a person having ordinary skill in the art, at the time of filing, Because Muller requires identifying commands in input text and Raffel “showed how this approach can be successfully applied to generative tasks like abstractive summarization, classification tasks like natural language inference…” Raffel sec. 4.1. Muller teaches claim 11. The system according to claim 10, further comprising a data post-processing unit that creates, on the basis of conversion information indicating corresponding relationships between control data and control explanation text, control data from the control explanation text inferred by the inference unit. (Muller abs “Input from a text editor containing lines of text of a script is received, commands to control objects in a simulation are identified in the lines of text in the editor, a state of the simulation is updated in accordance with the input and the commands…” emphasis added.) Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Austin Hicks whose telephone number is (571)270-3377. The examiner can normally be reached Monday - Thursday 8-4 PST. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Mariela Reyes can be reached at (571) 270-1006. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /AUSTIN HICKS/ Primary Examiner, Art Unit 2142
Read full office action

Prosecution Timeline

Aug 26, 2022
Application Filed
Apr 01, 2026
Examiner Interview Summary
Apr 01, 2026
Non-Final Rejection mailed — §101, §103
Apr 01, 2026
Applicant Interview (Telephonic)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12639558
NEURAL NETWORK PROCESSOR SYSTEM AND METHODS OF OPERATING AND FORMING THEREOF
4y 3m to grant Granted May 26, 2026
Patent 12626157
IDENTIFYING IDLE-CORES IN DATA CENTERS USING MACHINE-LEARNING (ML)
3y 7m to grant Granted May 12, 2026
Patent 12626178
QUANTUM COMPUTING BASED KERNEL ALIGNMENT FOR A SUPPORT VECTOR MACHINE TASK
3y 6m to grant Granted May 12, 2026
Patent 12608441
SCREENING FOR FLUCTUATING ENERGY RELAXATION TIMES
4y 1m to grant Granted Apr 21, 2026
Patent 12591767
NEURAL NETWORK ACCELERATION CIRCUIT AND METHOD
3y 9m to grant Granted Mar 31, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
75%
Grant Probability
99%
With Interview (+24.7%)
3y 2m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 411 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month