# US 2013/0254201 A1 · Data structure, data structure generation method, information processing apparatus, information processing system, and computer-readable storage medium having stored therein information processing program

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

- Number: US 2013/0254201 A1
- Document ID: US20130254201A1
- Status: Published application
- Kind: A1
- Application number: 13/477,718
- Filed: 2012-05-22
- Published: 2013-09-26
- Earliest claimed: 2012-03-21
- Assignees: Nintendo Co., Ltd.
- Inventors: Minoru HATAMOTO
- Web page: https://patentgrep.com/patent/US20130254201A1

## CPC

- G06F 16/9027: {Trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for generating a tree-type data structure composed of a plurality of data strings includes the steps of: summing, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at at least one given string position in each of the plurality of data strings; and classifying, based on the numbers of the data types respectively summed at the at least one given string position in the summing step, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.

## Claims

### Claim 1

A method for generating a tree-type data structure composed of a plurality of data strings, comprising the steps of:
summing, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at at least one given string position in each of the plurality of data strings; and
classifying, based on the numbers of the data types respectively summed at the at least one given string position in the summing step, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.

### Claim 2 (depends on 1)

The method according to claim 1, wherein
in the classifying step, a string position where the numbers of the data types respectively summed in the summing step are equal to each other or close to an equal value is specified, and the plurality of data strings classified in the parent node are classified into the plurality of child nodes, for the respective data types at the specified string position.

### Claim 3 (depends on 1)

The method according to claim 1, further including the step of:
controlling of recursively repeating a series of steps consisting of the summing step and the classifying step, using each child node created as a result of the classification in the classifying step as a parent node.

### Claim 4 (depends on 3)

The method according to claim 3, wherein
the controlling step recursively repeats the series of steps until each child node includes only one data string.

### Claim 5 (depends on 1)

The method according to claim 1, wherein
each data string is a bit string including a bit expressed by 0 or 1,
in the summing step, with respect to the plurality of data strings classified in the parent node, the numbers of bits 0 and the number of bits 1, each bit 0 and each bit 1 corresponding to the respective data types, are respectively summed at the at least one given bit position in each of the plurality of data strings, and
in the classifying step, based on the number of bits 0 and the number of bits 1, which are respectively summed in the summing step, the plurality of data strings are classified into two child nodes, in accordance with whether the bit at a given bit position is 0 or 1.

### Claim 6 (depends on 1)

The method according to claim 1, wherein
in the summing step, the numbers of the data types of data are respectively summed at every string position in each of the plurality of data strings.

### Claim 7

A tree-type data structure composed of a plurality of data strings, wherein
a plurality of data strings classified in a parent node is classified, based on the numbers of data types of data respectively summed at at least one given string position in each of the plurality of data strings, into a plurality of child nodes, for the respective data types at a given string position.

### Claim 8 (depends on 7)

A library including a plurality of functions and a plurality of addresses associated with a plurality of data strings indicating symbol names of the plurality of functions and associated with the symbol names, wherein
a data structure of the plurality of data strings indicating the symbol names is the data structure according to claim 7.

### Claim 9 (depends on 8)

A computer-readable storage medium having stored therein a game program to be used when the library according to claim 8 is used when performing a predetermined game processing.

### Claim 10

An information processing apparatus configured to generate a tree-type data structure composed of a plurality of data strings, comprising:
a summing section configured to sum, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at at least one given string position in each of the plurality of data strings; and
a classification section configured to classify, based on the numbers of the data types respectively summed at the at least one given string position by the summing section, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.

### Claim 11

An information processing system configured to generate a tree-type data structure composed of a plurality of data strings, comprising:
a summing section configured to sum, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at at least one given string position in each of the plurality of data strings; and
a classification section configured to classify, based on the numbers of the data types respectively summed at the at least one given string position by the summing section, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.

### Claim 12

A computer-readable storage medium having stored therein an information processing program to be executed by a computer of an information processing apparatus that generates a tree-type data structure composed of a plurality of data strings, the program causing the computer to function as:
a summing section configured to sum, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at at least one given string position in each of the plurality of data strings; and
a classification section configured to classify, based on the numbers of the data types respectively summed at the at least one given string position by the summing section, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.
