1.1First person camera view
The camera follows the controlled entity's position and orientation. The renderer draws the environment and battle objects, and contact flashes on the battle objects show where attacks land.
Generated automatically. Not reviewed by a person. Not legal advice or an opinion.
Questions about how individual parts of claim 1 might be changed. A question may describe something different from what the claim language recites, or a version of it; no view is offered on which.
The camera follows the controlled entity's position and orientation. The renderer draws the environment and battle objects, and contact flashes on the battle objects show where attacks land.
An encounter controller keeps a queue of opponent types and renders a single active opponent. When that opponent is defeated, the controller removes it from the scene and creates the next opponent at a spawn point.
A circular trigger centered on the controlled entity detects when a battle object enters it. The collision event queues an attack and records the identifier of the object that crossed the trigger boundary.
Each attackable object has a selectable marker. The player selects a marker and presses the attack control, which submits the selected object's identifier for a distance check before the attack executes.
For each active opponent, the selector tests whether a segment from the attacker to the opponent intersects a wall. It selects the unobstructed opponent with the lowest remaining health and applies a hit immediately.
Further arrangements of the same subject matter, described here as of the publication date at the foot of this page.
A warehouse simulator renders a trainee-controlled scanner and at least two parcels with removable digital labels. The first input removes a selected label layer from a parcel and stores the parcel identifier. The second input checks whether that parcel still has a label layer and lies within scanner range, then selects it if both conditions hold. Otherwise, the simulator selects the first eligible parcel in conveyor order and shows the scanner removing its top label layer.
A navigation mesh and an A-star path search replace the straight-line range test for a virtual character's second attack. The first attack stores the attacked object's identifier, and the second input projects the character and the stored object onto the mesh. The controller retains the stored object if a traversable path fits within the attack's path-length budget. Otherwise, it checks the remaining objects in turn order and displays the attack against the first object with a path within the budget.
A capsule overlap query replaces the distance test between object centers for the second attack. The first attack stores its target identifier, and the second input positions a capsule along the character's facing direction, with the capsule length and radius set by the attack configuration. The controller retains the stored target if any of its collision volumes overlap the capsule. Otherwise, it selects the first overlapping object in turn order and displays the attack against that object.
The scene displays one player-controlled character and up to 64 battle objects, with positions updated 30 times per second. The first attack stores the selected object's identifier, and the second input checks that object against a 6-meter attack radius on the next simulation tick. If the stored object falls outside the radius, the controller selects the in-range object with the earliest scheduled action and breaks ties by object identifier. The display starts the attack animation on the selection tick and keeps the selected identifier through the animation.
A multiplayer simulation server receives sequenced inputs from clients that render the player-controlled character and the battle objects. After resolving the first attack, the server stores its target identifier in the acting player's state. On the second input, the server tests the stored target against the attack range using positions from the processing tick and selects the first eligible object in turn order if the stored target falls outside the range. The server broadcasts the attacker identifier, target identifier, and start tick so each client displays the same attack.
The simulation stores the first attack's target identifier and the two most recent positions of each battle object. When the second input arrives, the controller retains the stored target if its current position lies within the attack range. Otherwise, it uses the position samples to estimate velocity and projects each in-range candidate 250 milliseconds forward to the end of the attack windup. It selects the candidate with the greatest predicted distance from the range boundary on the inside, and uses turn order if every projection falls outside.
A spatial query gathers opponents currently in range, and a damage log supplies each candidate's total damage to the controlled entity over the previous five seconds. The attack animation faces the candidate with the highest total, using object identifiers to resolve ties.
An overhead camera displays the controlled entity and two battle objects as animated sprites on a shared tile map. The renderer sorts the sprites by their ground position so that overlapping figures draw in depth order.
A pointer press casts a ray from the camera through the selected screen coordinate. The input handler queues the first attack with the identifier of the nearest battle object whose collision volume intersects the ray.
A press of the second attack control queries a spatial grid for battle objects within six scene units of the controlled entity. The selector compares squared center distances and returns the identifier of the closest candidate.
The second attack checks whether the opponent recorded by the first attack lies within six scene units. It uses that opponent when the check passes and the nearest in-range opponent when the check fails, then rotates the controlled entity toward the selected target and plays the attack animation.
Passages reproduced word for word from two earlier-published U.S. patent documents, placed beside the language of claim 1. No characterization is offered. Each passage is marked A or B for the document it comes from; ¶ numbers are the paragraph numbers in the USPTO’s published full text of that document.
In this regard, the video game delivered in the present embodiment is an RPG including a portion in which the video game proceeds when a plurality of characters, including a player character (that is, a character that moves in accordance with operations of a keypad by a player), moves on a field provided in a virtual three-dimensional space, or executes a battle against an enemy character that thwarts an action of the player character for accomplishment of a predetermined objA · US 7,722,467 B2 · ¶ 52
In this case, each of the player terminals includes an attack command receiver that receives specification of an attack command for specifying an attack action that a player character is caused to execute by means of an attack specification operation by the player.A · US 7,722,467 B2 · ¶ 11
However, although a user may perform a control such that a user character compulsorily performs a basic attack on a specific enemy character, by touching the corresponding enemy character on a display of a mobile terminal 100, the method for controlling an automatic attack according to the embodiment of the inventive concept may be applied to a situation other than a situation in which a basic attack is performed by targeting a specific enemy character.B · US 2017/0291108 A1 · ¶ 31
For example, when a plurality of enemy characters 400 are located within a basic attack range 330, the game server 200 has to select an enemy character 400, which is to be attacked first, and accordingly, the game server 200 may determine one of the plurality of enemy characters, which is to be attacked first, in consideration of a specific attack priority determined based on the types of the enemy characters, and may determine one of the enemy characters 400, which is closesB · US 2017/0291108 A1 · ¶ 66
The user character 300 may perform an attack when the enemy character 400 is located within the basic attack range 330.B · US 2017/0291108 A1 · ¶ 54
An empty cell means only that no passage was reproduced there.
This makes it possible to diversify the game contents.A · US 7,722,467 B2 · ¶ 7
Therefore, there has been a problem that diversification of the game contents has a limitation.A · US 7,722,467 B2 · ¶ 9
Embodiments of the inventive concept described herein relate a method for controlling an automatic attack of a user character, and more particularly, to a method for controlling an automatic attack of a user, which may be provided to an online service performed by a mobile terminal connected through a network.B · US 2017/0291108 A1 · ¶ 2
For example, it may not be easily for the users to consistently touch small buttons of the user interfaces so that the users may perform basic attacks of the user characters,.B · US 2017/0291108 A1 · ¶ 7
patent.fyi, US 2026/0355631 A1, claim 1, first published 2026-11-19T13:37:15-05:00, https://patent.fyi/US20260355631/, SHA-256 f957f8de3b7137fa01a366a3abdcb108176c33b3c654447ecaa0d6dfe022f1d1