# US 2012/0252569 A1 · System And Method For Dynamically Determining Paths Between Destinations In A Virtual Space

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0252569 A1
- Document ID: US20120252569A1
- Status: Published application
- Kind: A1
- Application number: 13/079,471
- Filed: 2011-04-04
- Published: 2012-10-04
- Earliest claimed: 2011-04-04
- Assignees: Maslow Six Entertainment, Inc.
- Inventors: Derek Harp; Bengt Gregory-Brown; Pat N. Savelli; James J. Hooker
- Web page: https://patentgrep.com/patent/US20120252569A1

## CPC

- A63F 13/358: Adapting the game course according to the network or server load, e.g. for reducing latency due to different connection speeds between clients
- A63F 13/47: involving branching, e.g. choosing one of several possible scenarios at a given point in time
- A63F 13/35: Details of game servers
- A63F 13/56: Computing the motion of game characters with respect to other game characters, game objects or elements of the game scene, e.g. for simulating the behaviour of a group of virtual soldiers or for path finding
- A63F 13/69: by enabling or updating specific game elements, e.g. unlocking hidden features, items, levels or versions
- A63F 13/79: involving player-related data, e.g. identities, accounts, preferences or play histories
- A63F 13/792: for payment purposes, e.g. monthly subscriptions
- A63F 2300/64: for computing dynamical parameters of game objects, e.g. motion determination or computation of frictional forces for a virtual car
- A63F 2300/8082: Virtual reality
- A63F: CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR

## Abstract

A system may be configured to host a virtual space for access by users. The virtual space may be a game space in which users control one or more characters (or sets of characters) to achieve game objectives. The system may be configured such that the travel paths within the virtual world are determined dynamically. This may provide for travel which may have dynamic aspects at a lower cost than providing full interactivity between destinations.

## Claims

### Claim 1

A system configured to host a virtual space to a client computing device for interaction by a user, the system comprising:
one or more processors configured to execute computer program modules, the computer program modules comprising:
a destination node module configured to instance destination nodes within the virtual space, the destination nodes comprising a first destination node and a second destination node, the destination node module being configured such that responsive to a user character associated with the client computing device being located at the first destination node the destination node module implements the instance of the first destination node to determine a view of the first destination node for presentation to the user via the client computing device;
a dynamic node module configured to instance dynamic nodes within the virtual space, and to implement the instances of the dynamic nodes to determine views of the dynamic nodes for presentation to the user via the client computing device;
a travel interface module configured to receive selection or entry by the user of a travel command indicating the user character should travel between the destination nodes;
a path module configured to dynamically determine paths between the destination nodes to include dynamic nodes such that responsive to reception of a travel command indicating the user character should travel between the first destination node and the second destination nodes the path module dynamically determines a first set of one or more of the dynamic nodes to be included in the path of the user character between the first destination node and the second destination node.

### Claim 2 (depends on 1)

The system of claim 1, wherein the travel interface module and the path module are configured such that the destination modes are accessible to the user character according to a map having potential paths between the destination modes, wherein responsive to the user character being located at the first destination mode, the travel interface module is configured to receive selection or entry of travel commands indicating the user should travel to one of the destination nodes included in a subset of destination nodes having potential paths with the first destination node.

### Claim 3 (depends on 2)

The system of claim 2, wherein the travel interface module and the path module are configured such that the potential paths comprise a first potential path between destination nodes that is unlockable.

### Claim 4 (depends on 3)

The system of claim 3, wherein the first potential path is unlockable based on one or both of gameplay and/or a purchase.

### Claim 5 (depends on 1)

The system of claim 1, wherein the path module is configured to determine which dynamic nodes to include in a path based on parameters associated with the user character.

### Claim 6 (depends on 1)

The system of claim 1, wherein the path module is configured to determine which dynamic nodes to include in a path based on one or more temporal parameters.

### Claim 7 (depends on 1)

The system of claim 1, wherein the path module and the dynamic node module is configured such that the first set of dynamic nodes comprises a first dynamic node having an objective, and such that the user character is prevented from proceeding past the first dynamic node toward the second destination node until the objective has been completed.

### Claim 8

A computer-implemented method of hosting a virtual space to a client computing device for interaction by a user, the method being implemented by a server having one or more processors configured to execute computer program modules, the method comprising:
executing an instance of a first destination nodes within the virtual space;
responsive to a user character associated with a client computing device being located at the first destination node, implementing the instance of the first destination node to determine a view of the first destination node for presentation to the user via the client computing device;
receiving from the user via the client computing receive a travel command indicating the user character should travel from the first destination node to a second destination node that is separate from the first destination node in the virtual space;
dynamically determining a path of the user character from the first destination node to the second destination node, wherein dynamic determination of the path comprises dynamically determining a set of one or more of the dynamic nodes to be included in path of the user character between the first destination node and the second destination node.

### Claim 9 (depends on 8)

The method of claim 8, wherein prior to receipt of the travel command the first destination node and the second destination node are connected in the virtual space by a potential path.

### Claim 10 (depends on 9)

The method of claim 9, wherein the potential path between destination nodes is unlockable.

### Claim 11 (depends on 10)

The method of claim 10, wherein the potential path is unlockable based on one or both of gameplay and/or a purchase.

### Claim 12 (depends on 8)

The method of claim 8, wherein the determination of which dynamic nodes to include in the path is based on parameters associated with the user character.

### Claim 13 (depends on 8)

The method of claim 8, wherein the determination of which dynamic nodes to include in the path based on one or more temporal parameters.

### Claim 14 (depends on 8)

The method of claim 8, wherein the path comprises a first dynamic node having an objective, and wherein the user character is prevented from proceeding past the first dynamic node toward the second destination node until the objective has been completed.

### Claim 15

A non-transient, machine-readable, electronic storage medium having instructions stored thereon causing one or more processors of a server to perform a method, the method comprising:
executing an instance of a first destination nodes within the virtual space;
responsive to a user character associated with a client computing device being located at the first destination node, implementing the instance of the first destination node to determine a view of the first destination node for presentation to the user via the client computing device;
receiving from the user via the client computing receive a travel command indicating the user character should travel from the first destination node to a second destination node that is separate from the first destination node in the virtual space;
dynamically determining a path of the user character from the first destination node to the second destination node, wherein dynamic determination of the path comprises dynamically determining a set of one or more of the dynamic nodes to be included in path of the user character between the first destination node and the second destination node.

### Claim 16 (depends on 15)

The electronic storage medium of claim 15, wherein prior to receipt of the travel command the first destination node and the second destination node are connected in the virtual space by a potential path.

### Claim 17 (depends on 16)

The electronic storage medium of claim 16, wherein the potential path between destination nodes is unlockable.

### Claim 18 (depends on 17)

The electronic storage medium of claim 17, wherein the potential path is unlockable based on one or both of gameplay and/or a purchase.

### Claim 19 (depends on 15)

The electronic storage medium of claim 15, wherein the determination of which dynamic nodes to include in the path is based on parameters associated with the user character.

### Claim 20 (depends on 15)

The electronic storage medium of claim 15, wherein the determination of which dynamic nodes to include in the path based on one or more temporal parameters.

### Claim 21 (depends on 15)

The electronic storage medium of claim 15, wherein the path comprises a first dynamic node having an objective, and wherein the user character is prevented from proceeding past the first dynamic node toward the second destination node until the objective has been completed.
