JP2006271705A - Processing device and processing method of numeric value group, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a processing device or the like of numeric value groups suitable for facilitating editing or the like of numeric values by forming hierarchies of various kinds of numeric value groups such as a parameter group or the like related to a character or a team. <P>SOLUTION: In the processing device of numeric value groups 201, a storage part 202 stores the numeric value groups in hierarchies based on a diagram structure having nodes and directed branches. An input receiving part 203 receives instruction input for editing the numeric value corresponding to a certain node. A first update part 204 updates the numeric value of the certain node according to the instruction input. A second update part 205 distributes change quantity of the numeric value to a child node of the node having the updated numeric value so as to update the numeric value of the child node. The processing is repeated until there are no child nodes for distribution. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a numerical group processing apparatus, a numerical group processing method, and a computer suitable for facilitating editing and comparison of numerical groups by hierarchizing various numerical groups such as a parameter group related to a character or team. It relates to the program to be realized in.

Conventionally, various techniques for editing and comparing various numerical groups have been proposed. There are various numerical groups such as a set of parameter values expressing the character ratings and settings of each character in the game, and the appearance frequency of each word in the document in text processing. A technique for processing / utilizing a numerical group of such character parameter values is disclosed in the following documents.
Japanese Patent No. 3343099 Japanese Patent No. 3425552

  In addition, a method of calculating the appearance frequency of a word in a document as a vector and calculating the similarity between the documents based on an angle formed by the vector is widely used.

  Now, some of these numerical groups are related or similar to each other. For example, consider the characteristics of a baseball team as follows. The characteristics of the team are broadly divided into attack power and defense power. Attack power includes striking power and running power. Striveling power includes the ability to steal pitcher motion, running power, and sliding ability. Defensive power includes pitcher power, infield power, and outfield power. Infield power includes running power, catching power, and stabbing power.

  In this way, various numerical groups can often be organized into a hierarchical structure according to their characteristics.

Therefore, the hierarchical structure, specifically,
(A) having a plurality of nodes and a directional branch connecting one node to another;
(B) The directional branch does not circulate even if it follows the direction,
(C) Any two nodes are not connected, or are connected by one directional branch (hereinafter, the node where the directional branch starts is “parent”, and the end node is “child”. ),
(D) By following a directional branch from a predetermined node (hereinafter referred to as “root”) in that direction, any other node can be reached;
(E) Each section is associated with a numerical value,
(F) There is a great demand for a user to easily edit a numerical group that can be arranged in a graph structure so as to satisfy the condition that a set of numerical values associated with each section becomes a numerical group.

  In addition, the user wants to be able to calculate the “large / small” and “similarity” of such a numerical group according to the user's preference, and to provide them for the convenience of the user's selection by appropriately sorting and presenting them. Is strong.

  The present invention has been made to solve the above-described problems, and facilitates editing and comparison of numerical groups by hierarchizing various numerical groups such as a parameter group related to a certain character or team. It is an object of the present invention to provide a suitable numerical value group processing apparatus, numerical value group processing method, and a program for realizing these on a computer.

  In order to achieve the above object, the following invention is disclosed in accordance with the principle of the present invention. In the present invention, as described above, it has a plurality of nodes and a directional branch that connects a certain node to another node, and does not circulate even if the directional branch is traced in that direction. Arbitrary two nodes are either not connected or connected by one directional branch (hereinafter, the node where the directional branch starts is called “parent”, and the end node is called “child”). Consider a graph structure that can reach any other node by following a directed edge from a predetermined node (hereinafter referred to as “root”).

  A numerical value group processing apparatus according to a first aspect of the present invention includes a storage unit, an input reception unit, a first update unit, and a second update unit, and is configured as follows.

  That is, the storage unit stores a numerical value group in which numerical values are associated with each of the nodes of the graph structure that can reach other arbitrary nodes.

  As described above, the numerical value (parameter) group hierarchized based on the graph structure is stored in association with each of the clauses included in the graph structure. Each of the parameters may be stored using the same tree structure, or the parameter may be used as it is as the information corresponding to the section of the graph structure, or the address of the location where the parameter is stored may be used. Conceivable.

  On the other hand, the input receiving unit selects one of the nodes in the graph structure (hereinafter referred to as “edit parent clause”), and the other end of the directional branch originating from the edit parent clause (hereinafter referred to as “edit child clause”). An instruction input for editing a numerical value stored in association with any of the above is accepted.

  For example, in the case of the above example, when root is selected as the editing parent clause, the editing child clause becomes “attack power” and “defense power”, and one of these values is edited. When “defense power” is selected as the editing master clause, the editor subsection becomes “pitcher power”, “infield power”, and “outfield power”, and any one of these values is edited.

  Further, the first updating unit updates a numerical value stored in association with any of the editing child clauses in the storage unit in response to an instruction input accepted.

  The instruction input may be, for example, direct input of a numerical value for each of the editing child clauses, or update of the numerical value by moving a slider or the like displayed on the screen.

  Then, when the numerical value stored in the storage unit is updated in association with one of the nodes of the graph structure (hereinafter referred to as “update parent clause”), the second update unit changes the numerical value related to the update. A numerical value obtained by distributing the minutes according to the rule associated with the editing parent clause is stored in association with each of the other ends of the directional branch originating from the updating parent clause (hereinafter referred to as “update child clause”). The storage unit is updated so as to be added to the numerical value, and the update of the storage unit is repeated using each of the updated update child clauses as a new update parent clause.

  For example, when the numerical value of the attack power is updated, both the striking power and the running power are updated accordingly. By updating the hitting force, the numerical value associated with the node below the hitting force is also updated. Moreover, the ability to steal the pitcher's motion, the running ability, and the slipping ability are updated by updating the running ability. Thus, when the numerical value of a certain section is updated, all the numerical values of the descendant sections of that section are updated based on a certain rule.

  According to the present invention, a numerical value group hierarchized by a graph structure is easily edited, and numerical values related to the numerical value to be edited are automatically updated so that numerical values by the user can be updated. Group editing can be facilitated.

  In the numerical value group processing apparatus of the present invention, the second update unit proportionally distributes the variation as a rule associated with the update parent clause by using a numerical value stored in association with each of the update child clauses. Can be configured to use rules.

  That is, as a simple and fair rule, proportional distribution according to the current numerical value is adopted, and the present invention relates to one of the preferred embodiments of the present invention.

  According to the present invention, since the update is sequentially repeated using a simple and easy-to-understand fair rule, the user can easily imagine the effect of updating the numerical value associated with a certain section. The numerical value group can be easily edited.

  In the numerical value group processing apparatus of the present invention, the first update unit may change the numerical value related to the update to each of the other clauses having the same parent as the editor child clause (hereinafter referred to as “edit sibling clause”). The storage unit is further updated so that the numerical value that is proportionally distributed by the numerical value stored in association with is subtracted from the numerical value stored in association with the editing sibling clause.

  For example, if the attack power is reduced by 10, the defense power is increased by 10. If the infield power is decreased by 5, the sum of the pitcher power and the outfield power is increased by 5. The increase of 5 keeps the ratio of the original pitcher power and the infield power. It's a matter of apportioning.

  According to the present invention, since the update is sequentially repeated using a simple and easy-to-understand fair rule, the user can easily imagine the effect of updating the numerical value associated with a certain section. The numerical value group can be easily edited.

  The numerical value group processing apparatus of the present invention can be configured as follows.

  That is, the storage unit further stores a coefficient group in which a coefficient is associated with each of the clauses.

  Each parameter is weighted by a coefficient.

  On the other hand, as a rule associated with the update parent clause, the second update unit proportionally distributes the variation of the numerical value related to the update by the product of the numerical value and the coefficient stored in association with each of the update child clauses. Use rules to

  Further, the first update unit associates the variation of the numerical value related to the update with each of the other clauses (hereinafter referred to as “edit sibling clauses”) having the same parent as the edit child clause. The storage unit is further updated so that the numerical value that is proportionally distributed by the product of the numerical value stored and the coefficient is subtracted from the numerical value stored in association with the editing sibling clause.

  The distribution of values at the time of updating is such that it does not change for the sum of the parameters of the same hierarchy, but it is not a simple proportional distribution, but a large change is apportioned for parameters with large weights. Is.

  According to the present invention, a weight is assigned to each parameter of the numerical value group, and the weight is further taken into consideration to make a proportional increase in the parameter so that the sum of numerical values in the same hierarchy is as small as possible. The user can easily imagine the effect of updating the numerical value associated with a certain section, and the numerical value group can be easily edited by the user.

  Moreover, the numerical value group processing apparatus of the present invention further includes a calculation unit and a sorting unit, and is configured as follows.

That is, the calculation unit provides an index for the numerical value group stored in the storage unit. (A) The index of a clause having no child is a numerical value stored in the storage unit in association with the relevant clause for the numerical value group.
(B) The index of the clause having a child is a numerical value obtained by calculating a weighted average using the index obtained for the child as a weight with a coefficient stored in the storage unit associated with the child,
(C) Calculation is performed by outputting the root index as the index of the numerical value group.

  The index calculated here is the average of each parameter from the bottom of the graph structure to the root with the weight of each parameter, and the graph structure is scored according to the weight assigned to each section. "

  On the other hand, the sorting unit sorts the plurality of numerical values according to an index calculated for each of the plurality of numerical values stored in the storage.

  That is, a plurality of numerical value groups prepared in association with the graph structure are sorted according to the result of scoring the graph structure with the weight assigned to each section.

  According to the present invention, it is possible to sort a plurality of numerical groups according to the weights associated with the graph structure, and the user can compare the numerical groups based on the index.

  Moreover, the numerical value group processing apparatus of the present invention further includes a calculation unit and a sorting unit, and can be configured as follows.

That is, the calculation unit obtains the similarity between the first numerical value group and the second numerical value group stored in the storage unit. (A) The similarity of a node having no children is calculated based on the first numerical value group and the second numerical value group. For the numerical value group of 2 and the product of numerical values associated with the clause and stored in the storage unit,
(B) The similarity of a clause having a child is a numerical value obtained by calculating a weighted average using the similarity obtained for the child as a weight with a coefficient stored in the storage unit in association with the child,
(C) The root similarity is calculated by outputting as the similarity between the first numerical value group and the second numerical value group.

  Here, the degree of similarity calculated with reference to the weight is one of indices indicating how much a certain numerical group is similar to another numerical group.

  On the other hand, the sorting unit sorts the plurality of other numerical groups according to the similarity calculated for any numerical group stored in the storage unit and each of the other plurality of numerical groups.

  That is, the other numerical groups are sorted in the order similar to a certain numerical group.

  According to the present invention, a plurality of numerical groups can be sorted in an order similar to a certain numerical group by weights associated with the graph structure, and the user can compare numerical groups using the index. Become.

  Further, in the numerical value group processing apparatus of the present invention, the calculation unit is configured to calculate a weighted average for a numerical value larger than the numerical value multiplied by the maximum value of the weight, excluding the weighted average. be able to.

  That is, since the parameter with the largest weight is the parameter that should be regarded as most important, if a parameter larger than this value is accidentally present, it is ignored.

  According to the present invention, it is possible to appropriately consider important parameters when sorting a plurality of numerical values.

  A numerical value group processing method according to another aspect of the present invention is executed by a numerical value group processing apparatus having a storage unit, an input reception unit, a first update unit, and a second update unit, and includes an input reception step, a first update step, The second update process is provided and configured as follows.

  That is, the storage unit stores a numerical value group in which numerical values are associated with each of the nodes of the graph structure.

  On the other hand, in the input receiving process, the input receiving unit selects one of the nodes of the graph structure (hereinafter referred to as “edit parent node”), and the node at the other end of the directed branch (hereinafter referred to as “edit parent node”). An instruction input for editing a numerical value stored in association with any one of “editing subsections” is accepted.

  Further, in the first updating step, the first updating unit updates a numerical value stored in association with any of the editing child clauses in the storage unit in response to an instruction input accepted.

  Furthermore, in the second update step, when the second update unit updates the numerical value stored in the storage unit in association with one of the nodes of the graph structure (hereinafter referred to as “update parent clause”), A numerical value obtained by distributing the variation of the numerical value related to the update according to the rule associated with the editing parent clause is assigned to each of the nodes at the other end of the directional branch originating from the updating parent clause (hereinafter referred to as “update child clause”). The storage unit is updated so as to be added to the numerical value stored in association with each other, and the update of the storage unit is repeated with each of the updated update clauses as a new update parent clause.

  A program according to another aspect of the present invention is configured to cause a computer to function as the numerical value group processing device or to cause the computer to execute the numerical value group processing method.

  The program of the present invention can be recorded on a computer-readable information storage medium such as a compact disk, flexible disk, hard disk, magneto-optical disk, digital video disk, magnetic tape, and semiconductor memory.

  The above program can be distributed and sold via a computer communication network independently of the computer on which the program is executed. The information storage medium can be distributed and sold independently from the computer.

  According to the present invention, a numerical group processing apparatus, a numerical group processing method, and the like suitable for facilitating editing and comparison of numerical groups by hierarchizing various numerical groups such as a parameter group related to a certain character or team. Can be provided on a computer.

  Embodiments of the present invention will be described below. In the following, for ease of understanding, an embodiment in which the present invention is realized using a game information processing device will be described. However, the embodiment described below is for explanation, and the present invention is described. It does not limit the range. Therefore, those skilled in the art can employ embodiments in which each or all of these elements are replaced with equivalent ones, and these embodiments are also included in the scope of the present invention.

  The information processing apparatus 100 includes a CPU 101, a ROM 102, a RAM 103, an interface 104, a controller 105, an external memory 106, an image processing unit 107, a DVD-ROM drive 108, and a NIC (Network Interface Card). 109 and an audio processing unit 110.

  A DVD-ROM storing a game program and data is loaded into the DVD-ROM drive 108 and the information processing apparatus 100 is turned on to execute the program. Realized.

  The CPU 101 controls the overall operation of the information processing apparatus 100 and is connected to each component to exchange control signals and data. Further, the CPU 101 uses arithmetic operations such as addition / subtraction / multiplication / division, logical sum, logical product, etc. using an ALU (Arithmetic Logic Unit) (not shown) for a storage area called a register (not shown) that can be accessed at high speed. , Logic operations such as logical negation, bit operations such as bit sum, bit product, bit inversion, bit shift, and bit rotation can be performed. In addition, the CPU 101 itself is configured so that saturation operations such as addition / subtraction / multiplication / division for multimedia processing, vector operations such as trigonometric functions, etc. can be performed at a high speed, and those provided with a coprocessor. There is.

  The ROM 102 records an IPL (Initial Program Loader) that is executed immediately after the power is turned on, and when this is executed, the program recorded on the DVD-ROM is read out to the RAM 103 and execution by the CPU 101 is started. The The ROM 102 stores an operating system program and various data necessary for operation control of the entire information processing apparatus 100.

  The RAM 103 is for temporarily storing data and programs, and holds programs and data read from the DVD-ROM and other data necessary for game progress and chat communication. Further, the CPU 101 provides a variable area in the RAM 103 and performs an operation by directly operating the ALU on the value stored in the variable, or temporarily stores the value stored in the RAM 103 in the register. Perform operations such as performing operations on registers and writing back the operation results to memory.

  The controller 105 connected via the interface 104 receives an operation input performed when the user executes a game such as a racing game.

  The external memory 106 detachably connected via the interface 104 stores data indicating the play status (past results, etc.) of the battle game, data indicating the progress of the game, and chat communication log (record) associated with the battle. ) Is stored in a rewritable manner. The user can record these data in the external memory 106 as appropriate by inputting an instruction via the controller 105.

  A DVD-ROM mounted on the DVD-ROM drive 108 stores a program for realizing the game and image data, audio data, and moving image information data associated with the game. Under the control of the CPU 101, the DVD-ROM drive 108 performs a reading process on the DVD-ROM loaded therein, reads out necessary programs and data, and these are temporarily stored in the RAM 103 or the like.

  The image processing unit 107 processes the data read from the DVD-ROM by an image arithmetic processor (not shown) included in the CPU 101 or the image processing unit 107, and then processes the processed data on a frame memory ( Buffering recording (not shown). The image information recorded in the frame memory is converted into a video signal at a predetermined synchronization timing and output to a monitor (not shown) connected to the image processing unit 107. Thereby, various image displays are possible. Such processing of the image processing unit 107 can be performed in parallel with the arithmetic processing of the CPU 101.

  The image calculation processor can execute a two-dimensional image overlay calculation, a transparency calculation such as α blending, and various saturation calculations at high speed.

  Also, polygon information arranged in the virtual three-dimensional space and added with various texture information is rendered by the Z buffer method, and the polygon arranged in the virtual three-dimensional space from the predetermined viewpoint position is determined in the direction of the predetermined line of sight It is also possible to perform high-speed execution of operations for obtaining rendered images.

  Further, the CPU 101 and the image arithmetic processor operate in a coordinated manner, so that a character string can be drawn as a two-dimensional image in a frame memory or drawn on the surface of each polygon according to font information that defines the character shape. is there. The font information is recorded in the ROM 102, but it is also possible to use dedicated font information recorded in the DVD-ROM.

  In addition, the moving image information recorded on the DVD-ROM and the moving image information when this is transferred to the RAM 103 or the like in advance are superimposed on a predetermined area of the screen by the image processing unit 107, Movie display can be performed.

  The NIC 109 is used to connect the information processing apparatus 100 to a computer communication network (not shown) such as the Internet, and is used in configuring a LAN (Local Area Network). 10BASE-T / 100BASE- Connect to the Internet using an analog modem, ISDN (Integrated Services Digital Network) modem, ADSL (Asymmetric Digital Subscriber Line) modem, or cable television line to connect to the Internet using a telephone line. For example, and an interface (not shown) that mediates between them and the CPU 101.

  The current date and time information can be obtained by connecting to an SNTP server in the Internet via the NIC 109 and obtaining information therefrom. In addition, various network game server devices may be configured and configured to perform the same functions as the SNTP server.

  The audio processing unit 110 converts audio data read from the DVD-ROM into an analog audio signal and outputs the analog audio signal from a speaker (not shown) connected thereto. Further, under the control of the CPU 101, sound effects and music data to be generated during the progress of the game are generated, and sound corresponding to this is output from the speaker.

  When the audio data recorded on the DVD-ROM is MIDI data, the audio processing unit 110 refers to the sound source data included in the audio data and converts the MIDI data into PCM data. If the compressed audio data is in ADPCM format or Ogg Vorbis format, it is expanded and converted to PCM data. The PCM data can be output by performing D / A (Digital / Analog) conversion at a timing corresponding to the sampling frequency and outputting it to a speaker.

  Furthermore, a microphone can be connected to the information processing apparatus 100 via the interface 104. In this case, the analog signal from the microphone is subjected to A / D conversion at an appropriate sampling frequency so that processing such as mixing in the audio processing unit 110 can be performed as a PCM format digital signal. When the information processing apparatus 100 is used as a game apparatus, voice data input from a microphone can be used as instruction input data as an input device instead of the controller 105.

  In addition, the information processing apparatus 100 uses a large-capacity external storage device such as a hard disk so as to perform the same function as the ROM 102, the RAM 103, the external memory 106, the DVD-ROM mounted on the DVD-ROM drive 108, and the like. You may comprise.

  Further, it is possible to adopt a form in which a keyboard for accepting a character string editing input from a user, a mouse for accepting various position designations and selection inputs, and the like are connected. In addition, a general-purpose personal computer can be used instead of the information processing apparatus 100 of the present embodiment.

  Similar to the information processing apparatus 100, a general computer includes a CPU, RAM, ROM, DVD-ROM drive, and NIC, and includes an image processing unit that is not necessarily specialized for screen display in a game. In addition to having a hard disk as a storage device, a flexible disk, a magneto-optical disk, a magnetic tape, or the like is generally available. In addition, a keyboard, a mouse or the like is used as an input device instead of a controller.

  Therefore, it is possible to operate such a general computer as the numerical value group processing apparatus of the present invention.

  FIG. 2 is a schematic diagram showing a schematic configuration of a numerical value group processing apparatus according to one embodiment of the present invention. Hereinafter, a description will be given with reference to FIG.

  The numerical value group processing apparatus 201 is realized by causing the information processing apparatus 100 to execute a program, and includes a storage unit 202, an input receiving unit 203, a first update unit 204, a second update unit 205, a calculation unit 206, and a sort unit 207. Prepare.

  Here, the RAM 103, hard disk, etc. serve as the storage unit 202, the controller 105, keyboard, mouse, etc. serve as the input reception unit 203, and the CPU 101 cooperates with the RAM 103, hard disk, etc., the first update unit 204, second update. Each of the units 205 functions.

  First, the storage unit 202 stores a numerical value group in which a numerical value is associated with each of the nodes of the graph structure that can reach other arbitrary nodes. FIG. 3 is an explanatory diagram illustrating a state in which one of the graph structures is stored in the storage unit. Hereinafter, a description will be given with reference to FIG.

  As shown in the figure, the graph structure 301 includes a plurality of nodes 302 and a directional branch 303 connecting one node 302 to another node 302. The directional branch 303 has a direction, and in this figure, the direction is expressed using an arrow.

  Even if the directional branch 303 is sequentially traced in that direction, it does not circulate. Therefore, the graph structure 301 can also be considered as a kind of tree structure. Therefore, the node where the directional branch 303 of the nodes 302 connected by one directional branch 303 starts is called “parent”, and the end node is called “child”.

  When any two nodes 302 are selected from the graph structure 301, they are either not connected or connected by one directional branch 303. That is, the number of directional branches 303 connecting the two nodes 302 is at most one.

  Since the graph structure 301 is a kind of tree structure, it has a node 302 corresponding to “root”. When the directional branch 303 is traced from the root node 302, there is always a path to reach any other node 302. Thereby, the graph structure 301 is integrated as a whole.

Each clause 302 can be configured as a structure in memory. At this time, each section 302 stores the following information.
(A) The total number of children of the clause.
(B) An array of structure addresses representing the child nodes of the clause. This information corresponds to the directional branch 303.
(C) Name of the section (parameter name).
(D) Subscript in the numerical value group array described later.
(E) A coefficient characterizing the template when the graph structure 301 is used as a template.

  In addition, various additional information may be stored in the structure. In addition, the name of the clause may be recorded as an address where the character string is secured in the memory, instead of storing the character string in the structure as it is.

  In the graph structure 301 shown in the figure, the hierarchical structure of the above-mentioned baseball team parameters is expressed. Each section 302 has an attack power, a defense power, a batting power, a striking power, an ability to steal the pitcher's motion, Parameters such as running force, sliding ability, pitcher force, infield force, outfield force, running force, ball catching force, and stabbing force are assigned. Note that there are nodes representing various parameters not shown in the figure, and directed branches to such nodes are indicated by dotted lines.

  In addition, the running power is a child of running ability and a child of infielder. Thus, in the graph structure of the present invention, multiple parents may share the same child.

  Now, the numerical value group matched with such a graph structure is expressed as a numerical value array in this embodiment. In the figure, a plurality of numerical value groups 311 are represented as an array.

  As described above, the subscript in the array of the numerical value group 311 of the parameter of the relevant section is recorded in the section 302 of the graph structure 301. That is, attack power 0, defensive power 1, striking power 2, striking power 3, ability to steal pitcher motion 4, running power 5, ability to slide 6, pitcher power 7, infield power 8, outfield power 9, catching ball It has a power of 10 and a stabbing power of 11.

  Accordingly, when it is desired to know the infield force in a certain numerical value group 311, the eighth element of the array of the numerical value group 311 can be viewed.

  Since a plurality of numerical value groups 311 are prepared in the memory, it is convenient for the user to sort the numerical value groups 311 by some method when comparing and contrasting the numerical value groups 311 with each other. .

  The graph structure 301 is not necessarily limited to one, and a plurality of graph structures 301 may be provided for the same numerical value group 311. Different graph structures 301 may differ in their structure itself, but typically only “coefficients” stored in each section 302 are different. “Coefficient” is a numerical value that characterizes a template when the graph structure 301 is used as a template. The numerical value group 311 is sorted based on a certain template, or the numerical value group 311 is sorted based on another template. For example, since different sort results can be obtained, various templates are prepared or created according to the user's request.

  The sorting method will be described later.

  In the present embodiment, the numerical value group 311 is edited under the situation where there is such a graph structure 301 and the numerical value group 311. At this time, the “parent of the section 302 to be edited” is selected. No. 302 ”(hereinafter referred to as“ edit parent clause ”). In other words, the child section 302 of the editing parent clause (hereinafter referred to as “editing child clause”) is to be edited.

  For example, if the root node 302 of the graph structure 301 is an editing parent node, the editing child nodes are an attack power node 302 and a defense power node 302. When the defense power section 302 is the editing master section, the editing child sections are the pitcher power section 302, the infield power section 302, and the outfield power section 302.

  In this way, by selecting one editing parent clause, it is possible to edit the numerical value group 311 in an easy-to-understand manner for the user by handling a plurality of parameters of the editing child clauses under a certain complementary relationship collectively. To do.

  FIG. 4 is a flowchart showing a control flow of the numerical value group editing process executed by the numerical value group processing apparatus according to the present embodiment. Hereinafter, a description will be given with reference to FIG.

  When the numerical value group editing process is started, the input receiving unit 203 displays an outline of the graph structure 301 on the screen (step S401), and allows the user to select one of the sections as an editing parent section from the outline (step S402). ), A screen for editing the parameters of the child clause of the editing parent clause is displayed (step S403), a copy of the numerical value group 311 currently being edited is temporarily created (step S404), and the parameter An input for editing either one is accepted (step S405).

  FIG. 5 is a schematic diagram showing an outline of the graph structure displayed on the screen. Hereinafter, a description will be given with reference to FIG.

  On the left side of the screen 501, an outline of the graph structure 301 is displayed. The graph structure 502 shown on the left side of the screen 501 has a shape similar to that shown in FIG. 3, but there is a parent clause that omits display of children in the middle. When “+” is written next to the name of the parent clause, it means that the parent clause has a child and the display of the child is omitted. If “-” is written, it means that children are also displayed.

  The user selects any section from the graph structure 502 by using the controller 105, a mouse, or the like. When selecting using the controller 105, the cursor 504 in the screen is moved using various arrow keys. When the cursor 504 moves over a desired section prepared in the controller 105, When the pressing operation is performed, the section is selected, and if the state of the section is “+”, the display of the graph structure 502 is updated so as to be “−”.

  In addition, when the X button is pressed on a certain section, if the current state of the section is “+”, it is “−”, and if the current state of the section is “−”, it is “+”. The display of the graph structure 502 is updated respectively.

  On the right side of the screen 501, all the parameters of the editing child clause that is a child of the selected editing parent clause are displayed as a star graph 503.

  In the example shown in the figure, since “infield power” is selected as the editing parent clause, three parameters of “running power”, “ball catching power”, and “stabing power” are displayed in a triangular shape as a star graph 503. Has been.

  When the cursor 504 is moved to the vicinity of the vertex of the star graph 503 and the ◯ button is pressed, the parameter is selected and the edit mode for the parameter is started. In this mode, when an arrow key is used, the parameter value increases with the up arrow key, and the parameter value decreases with the down arrow key. When the x button is pressed, the editing mode for the parameter is exited.

  Various other methods for displaying and editing the numerical values are conceivable. For example, a numerical value for each of the editing child clauses may be directly input, or a numerical value may be updated by moving a slider or the like displayed on the screen.

  Now, when a parameter of a certain editor clause is edited in this way, the numerical value of the editing result is temporarily stored in the copy created in step S404 (step S406), and edited to the original numerical value group 311. The instruction input is reflected as follows.

  First, an edit child clause to be edited is added to the container structure for storing the “update parent clause” prepared in the RAM 103 (step S407). As the container structure, for example, a stack or a queue can be adopted, and one or more addresses of the node 302 are held in these. The process of adding is push or enqueue.

  Next, it is checked whether or not the container structure is empty (step S408). If it is not empty (step S408; No), one of the nodes 302 is taken out from the container structure by pop or dequeue (step S408). Step S409).

  Then, the numerical value before editing of the extracted section 302 is acquired from the array of the numerical value group 311 in the memory, the numerical value after editing is acquired from the array of copies in the memory, and the change amount Δ of the numerical value of the section is acquired. Is calculated (step S410). The change amount Δ is obtained by subtracting the former from the latter.

  Next, the amount of change Δ is changed from the node 302 (hereinafter referred to as “update parent node”) extracted in step S409 to the child node 302 (hereinafter referred to as “update child node”) of the update parent clause. The distribution amount to be distributed to each is calculated based on the rule (step S411).

The following can be considered as this allocation rule. In the following, it is assumed that the number of update child clauses is N.
(A) Simply distribute equally. That is, each distribution amount is expressed as Δ / N,.
And

(B) When the current value of the current update subclause is p ₁ ,..., P _N ,
T = Σ _{i = 1} ^N p _i
To calculate the distribution amount of each
Δp ₁ / T,…, Δp _N / T
And

(C) the current value of p ₁ of the current update child nodes, ..., a p _N, when it is stored in the update child nodes "factor" has to be w _1, ..., w _N,
S = Σ _{i = 1} ^N w _i p _i
And each distribution amount is calculated as Δw ₁ p ₁ / S,…, Δw _N p _N / S
And

(D) the current value of the current update child nodes p _1, ..., a p _N, is stored in the update child nodes "Factor" is w _1, ..., is a w _N, one of the "coefficient" When the largest is w _H
S '= Σ _{i = 1} ^N f _i w _i p _i
And each allocation amount is calculated as Δf ₁ w ₁ p ₁ / S ′,…, Δf _N w _N p _N / S ′
And However, f _i is defined as follows.
f _i = 1, (p _i ≤p _H );
= 0, (p _i > p _H )

  (E) In addition, a rule that determines the distribution amount of these parameters is adopted so that a predetermined relationship between the update parent clause and the update child clause is maintained.

  Furthermore, the calculated distribution amount is distributed to each update subclause, and each is added to the value of the update subclause in the copy array (step S412), and each update subclause is added to the container structure ( Step S413) and the process returns to Step S408.

  If the node extracted in step S409 has no children, the processing in steps S410 to S413 need not be executed, and the process may return to step S408 immediately.

  By this loop processing, all reachable nodes 302 in the graph structure 301 are passed along the direction of the directional branch 303. However, as described above, since there is no circulation in the graph structure 301, this loop processing is performed. Always ends. Therefore, if it is empty in step S408 (step S408; Yes), all the results after updating the necessary parameters of the clause 302 in the graph structure 301 are obtained by editing by the user. Is overwritten and transferred to the array of the numerical value group 311 to be edited (step S414), the final update result is obtained, and the process is terminated.

  As described above, according to the present embodiment, a numerical value group hierarchized by the graph structure can be easily edited, and numerical values related to the numerical value to be edited are automatically updated. Thus, editing of the numerical value group by the user can be facilitated.

  Note that the calculation unit 206 and the sorting unit 207 are optional elements, and these functions will be described in [Example 3] described later.

  In the above method, when a parameter of a section is changed, only the descendant parameters of the section are updated. However, in this embodiment, when a parameter of a section is changed, the section is updated. It is also assumed that the “brother” of is updated. Another clause whose parent is the same clause as a clause is called the “brother” of that clause.

  In general, parameters in the same hierarchy often have a trade-off relationship such that when a certain parameter increases, other parameters decrease. The present embodiment corresponds to such a relationship.

  In other words, in the present embodiment, after the processing in steps S411 to S413, the following processing is executed for the siblings of the update parent clause, and then the processing returns to step S408.

  FIG. 6 is a flowchart for explaining the flow of control of the added process. Hereinafter, a description will be given with reference to FIG.

  When step S413 is completed, a distribution amount for allocating the update amount Δ of the updated parent clause to each of its siblings is calculated based on the rule (step S601).

  As the distribution rule, the following can be considered as in the case of the update subclause described above. In the following, M is the number of siblings in the updated parent clause.

(A) Simply distribute equally. In other words, each allocation amount
-Δ / M, ...,-Δ / M
And

(B) the current value of the current of the brothers q _1, ..., when it is to be a q _M,
V = Σ _{i = 1} ^M q _i
To calculate the distribution amount of each
-Δq ₁ / V, ..., -Δq _M / V
And

(C) the current value of the current of the brothers q _1, ..., a q _M, is stored in the sibling section of "Factor" is y _1, ..., when it is to be a y _M,
R = Σ _{i = 1} ^M y _i q _i
And calculate the distribution amount of each
-Δy ₁ q ₁ / R, ..., -Δy _M q _M / R
And

(D) the current value of q ₁ of the current brothers, ..., a q _M, "factor" to be stored in the sibling section of y _1, ..., a y _M, the largest of its "coefficient" When things are y _K
R '= Σ _{i = 1} ^M g _i y _i q _i
And each distribution amount is expressed as Δg ₁ y ₁ q ₁ / R ′,…, Δg _M y _M q _M / R ′
And However, g _i is defined as follows.
g _i = 1, (q _i ≤q _K );
= 0, (q _i > q _K )

  (E) In addition, a rule that determines the distribution amount of these parameters is adopted so that a predetermined relationship between the updated parent clause and its sibling is maintained.

  Unlike the case of the update subclause, the minus sign is attached because they are assumed to be in a trade-off relationship.

  Further, the calculated allocation amount is allocated to each sibling, each is added to the value of the corresponding sibling in the copy array (step S602), and each sibling is added to the container structure (step S603). The process returns to step S408.

  As described above, since there is no circulation in the directional branch 303, the loop always ends even if this processing is added.

  According to the present invention, since a repetitive update is performed using a simple and easy-to-understand fair rule, the user imagines the effect of a trade-off when a numerical value associated with a section is updated. This facilitates the editing of the numerical value group by the user.

  It should be noted that it is more convenient to be able to freely move between the editing mode of a section and the other modes. In addition, while entering the editing mode of a certain editor subsection, it is often easy for the user to understand the change in the numerical value when the numerical value of another section is updated following the user's editing instruction input. . Therefore, the order of control in the above flowchart may be changed as appropriate.

  Hereinafter, an embodiment will be described in which the order of the numerical value groups 311 is determined according to some criteria. In this case, first, the user selects one of the prepared graph structures 301 as a template, determines the order, and performs sorting. Therefore, the CPU 101 functions as the calculation unit 206 and the sorting unit 207 in cooperation with the RAM 103 and the like.

In the first method, the calculation unit 206 recursively calculates the following indices bottom-up for each of the clauses 302 included in the graph structure 301 serving as a template. That is,
(A) The index of the node 302 having no children is a numerical value stored in the storage unit 202 in association with the node 302 for the numerical value group 311.
(B) The index of the node 302 having a child is a numerical value obtained by calculating the weighted average using the index obtained for the child as a weight with the coefficient stored in the storage unit 202 in association with the child.
(C) The index of the root node 302 is output as the index of the numerical group.

  The index calculated here is the average of each parameter from the bottom of the graph structure to the root with the weight of each parameter, and the graph structure is scored according to the weight assigned to each section. "

In the second method, the calculation unit 206 uses a graph structure 301 as a template and a selected numerical value group 311 (first numerical value group), and the other numerical value group 311 (second numerical value group). ) Is calculated. That is,
(A) The similarity of the node 302 having no children is the product of the values stored in the storage unit 202 in association with the node for the first numerical value group 311 and the second numerical value group 311.
(B) The similarity of the node 302 having a child is a numerical value obtained by calculating the weighted average using the similarity obtained for the child as a weight with the coefficient stored in the storage unit 202 as a weight. .
(C) The similarity of the root node 302 is output as the similarity between the first numerical value group 311 and the second numerical value group 311.

  The index calculated here is a similarity indicating how similar a certain numerical group is to another numerical group.

In these calculations, as in the method using f _i and g _i described above, the numerical value larger than the value multiplied by the maximum value of the weight is excluded from the target for calculating the weighted average. You may make it calculate an attached average.

  Since the parameter with the largest weight is the parameter that should be regarded as most important, if a parameter larger than this value is accidentally present, it is ignored.

  Then, the sorting unit 207 sorts and outputs the numerical value group based on the index calculated in this way.

  If the user sees the result of this sort, for example, a team that is similar to another team or has a certain tendency is the one with the highest degree of this tendency. , Etc. can be obtained.

  As described above, according to the present invention, a numerical group processing device suitable for facilitating editing and comparison of numerical groups by hierarchizing various numerical groups such as a parameter group related to a certain character or team, A numerical group processing method and a program for realizing them can be provided, and can be applied to various authentication techniques.

It is a schematic diagram which shows schematic structure of the information processing apparatus for typical games which implement | achieves the numerical value group processing apparatus of this invention by execution of a program. It is a schematic diagram which shows schematic structure of the numerical value group processing apparatus which concerns on embodiment of this invention. It is explanatory drawing which shows the mode of the graph structure processed with the numerical value group processing apparatus which concerns on this embodiment, and a numerical value group. It is a flowchart which shows the flow of control of the numerical value group edit process performed with the numerical value group processing apparatus which concerns on this embodiment. It is a schematic diagram which shows the outline of the graph structure displayed on a screen. It is a flowchart which shows the flow of control of an additional process.

Explanation of symbols

100 Information processing apparatus 101 CPU
102 ROM
103 RAM
104 Interface 105 Controller 106 External Memory 107 Image Processing Unit 108 DVD-ROM Drive 109 NIC
DESCRIPTION OF SYMBOLS 110 Speech processing part 201 Numerical value group processing apparatus 202 Storage part 203 Input reception part 204 1st update part 205 2nd update part 206 Calculation part 207 Sort part 301 Graph structure 302 Clause 303 Directed branch 311 Numerical value group 501 Screen 502 Graph structure 503 Star graph 504 cursor

Claims (9)

It has a plurality of nodes and a directional branch connecting from one node to another, and it does not circulate even if the directional branch is traced in that direction, and any two nodes are not connected, They are either connected by one directional branch (hereinafter, the node where the directional branch starts is referred to as “parent” and the end node is referred to as “child”), and a predetermined node (hereinafter referred to as “root”). ) To store a numerical value group in which a numerical value is associated with each of the nodes of the graph structure that can reach other arbitrary nodes by following the directed branch in that direction,
By selecting one of the nodes of the graph structure (hereinafter referred to as “edit parent clause”), it is selected as one of the nodes at the other end of the directional branch originating from the edit parent clause (hereinafter referred to as “edit child clause”). An input receiving unit for receiving an instruction input for editing a numerical value stored in association;
A first updating unit for updating a numerical value stored in association with any of the editing child clauses in the storage unit by an instruction input accepted for the input;
When a numerical value stored in the storage unit in association with one of the clauses of the graph structure (hereinafter referred to as “update parent clause”) is updated, a variation of the numerical value related to the update is stored in the editing parent clause. The numerical value allocated according to the rule to be associated is added to the numerical value stored in association with each of the nodes at the other end of the directional branch originating from the update parent clause (hereinafter referred to as “update child clause”). A numerical value group processing apparatus comprising: a second update unit that updates the storage unit and repeats the update of the storage unit with each of the updated update child clauses as a new update parent clause. The numerical value group processing apparatus according to claim 1,
The second update unit uses, as a rule associated with the update parent clause, a rule that proportionally distributes the variation with a numerical value stored in association with each of the update child clauses. . The numerical value group processing apparatus according to claim 2,
The first updating unit is proportional to the numerical value stored in association with each of the other clauses having the same parent as the editing child clause (hereinafter referred to as “editing brother clause”). The storage unit is further updated so that the distributed numerical value is subtracted from the numerical value stored in association with the edited sibling clause. The numerical value group processing apparatus according to claim 1,
The storage unit further stores a coefficient group in which a coefficient is associated with each of the clauses,
The second update unit, as a rule associated with the update parent clause, proportionally distributes the variation of the numerical value related to the update by the product of the numerical value and the coefficient stored in association with each of the update child clauses. Using rules,
The first update unit associates the variation of the numerical value related to the update with each of other clauses (hereinafter referred to as “edit sibling clauses”) having the same parent as the edit child clause. The storage unit is further updated so that a numerical value proportionally distributed by the product of the numerical value and the coefficient stored is subtracted from the numerical value stored in association with the editing sibling clause. The numerical value group processing apparatus according to claim 4,
An index for a numerical value group stored in the storage unit is (a) an index of a node having no child is a numerical value stored in the storage unit in association with the clause for the numerical value group,
(B) The index of the clause having a child is a numerical value obtained by calculating a weighted average using the index obtained for the child as a weight with a coefficient stored in the storage unit in association with the child,
(C) a calculation unit that calculates a root index as an index of the numerical value group;
A sorting unit that sorts the plurality of numerical groups according to the calculated index for each of the plurality of numerical groups stored in the storage unit;
An object further comprising: The numerical value group processing apparatus according to claim 4,
The similarity between the first numerical value group and the second numerical value group stored in the storage unit is as follows. (A) The similarity of a node having no children is calculated for the first numerical value group and the second numerical value group. The product of numerical values associated with the clause and stored in the storage unit,
(B) The similarity of a clause having a child is a numerical value obtained by calculating a weighted average using the similarity stored for the child as a weight and a coefficient stored in the storage unit as a weight,
(C) a calculation unit that calculates a root similarity as a similarity between the first numerical value group and the second numerical value group;
A sorting unit that sorts the plurality of other numerical groups according to the calculated similarity with respect to any one of the numerical groups stored in the storage unit and each of the plurality of other numerical groups; Things to do. The numerical value group processing apparatus according to claim 5 or 6,
The calculation unit calculates a weighted average for a numerical value larger than a numerical value multiplied by the maximum value of the weight and excludes the weighted average from a target to be calculated. A numerical value group processing method executed by a numerical value group processing apparatus having a storage unit, an input receiving unit, a first update unit, and a second update unit,
The storage unit includes a plurality of nodes and a directional branch connecting a certain node to another node, and does not circulate even if the directional branch is traced in the direction, and any two nodes Are connected by one directional branch (hereinafter, the node where the directional branch starts is called “parent” and the end node is called “child”), and a predetermined clause ( (Hereinafter referred to as “root”), a numerical group in which a numerical value is associated with each of the nodes of the graph structure that can reach other arbitrary nodes by tracing the directed edge in the direction is stored,
When the input receiving unit selects one of the nodes of the graph structure (hereinafter referred to as “edit parent clause”), the other end of the directional branch originating from the edit parent clause (hereinafter referred to as “edit child clause”). An input receiving step of receiving an instruction input for editing a numerical value stored in association with any one of
A first updating step in which the first updating unit updates a numerical value stored in association with any of the editing child clauses in the storage unit by an instruction input in which the input is accepted;
When the numerical value stored in the storage unit is updated in association with one of the nodes of the graph structure (hereinafter referred to as “update parent clause”), the second update unit changes the numerical value related to the update. A numerical value obtained by distributing the minutes according to the rule associated with the editing parent clause is stored in association with each of the other ends of the directional branch originating from the updating parent clause (hereinafter referred to as “update child clause”). A second update step of updating the storage unit so as to be added to a numerical value, and repeating the update of the storage unit with each of the updated update child clauses as a new update parent clause. Method. Computer
It has a plurality of nodes and a directional branch connecting from one node to another, and it does not circulate even if the directional branch is traced in that direction, and any two nodes are not connected, They are either connected by one directional branch (hereinafter, the node where the directional branch starts is referred to as “parent” and the end node is referred to as “child”), and a predetermined node (hereinafter referred to as “root”). ) To store a numerical value group in which a numerical value is associated with each of the nodes of the graph structure that can reach other arbitrary nodes by following the directed branch in that direction,
By selecting one of the nodes of the graph structure (hereinafter referred to as “edit parent clause”), it is selected as one of the nodes at the other end of the directional branch originating from the edit parent clause (hereinafter referred to as “edit child clause”). An input receiving unit for receiving an instruction input for editing a numerical value stored in association;
A first updating unit for updating a numerical value stored in association with any of the editing child clauses in the storage unit by an instruction input accepted for the input;
When a numerical value stored in the storage unit in association with one of the clauses of the graph structure (hereinafter referred to as “update parent clause”) is updated, a variation of the numerical value related to the update is stored in the editing parent clause. The numerical value allocated according to the rule to be associated is added to the numerical value stored in association with each of the nodes at the other end of the directional branch originating from the update parent clause (hereinafter referred to as “update child clause”). A program for updating the storage unit and causing each of the updated update clauses to function as a second update unit that repeats the update of the storage unit as a new update parent clause.

Images