JP2002346212A - Music arrangement program, medium recorded with music arrangement program, music arrangement device and music arrangement method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a music arrangement program, a medium in which the program is recorded, a music arrangement device and a music arrangement method, by which music can be played effectively corresponding to the progress of a game. SOLUTION: Music such as the BGM of the game is divided into a non-loop object section which is not suitable for repeating of playing and a loop object section which is suitable for repeating of playing and optional addition and deletion and combined corresponding to a playing time varying one after another to realize optional playing time and to realize very effective arrangement as the BGM of the game.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a music arrangement program for arranging music in order to play music in accordance with the progress of a game, a medium recording the music arrangement program, a music arrangement apparatus and a music arrangement method.

[0002]

2. Description of the Related Art In a game machine using a computer, music is often played in accordance with the display of an image.
In the case of a general game, the time at which the game ends is not fixed, so that the music is often played repeatedly, and the timing at which the performance ends does not matter.

[0003] However, although there is a timing at which the race ends, as in a horse racing game, if the race time is not constant, the music performance timing cannot be adjusted, and the music is faded out at the end of the race. .

[0004]

The above-mentioned conventional game machine has the following problems. In the case of horse racing, the drama from the start to the end of the race constitutes one drama, and the pattern develops at that time. At the end of the race, a stunning performance is very effective. However, since the end timing is usually different for each race, it has not been possible to synchronize the timing of the music performance with the race.

The present invention has been made in view of the above problems, and has a music arrangement program capable of effectively playing music in accordance with the progress of a game.
It is an object of the present invention to provide a medium recording a music arrangement program, a music arrangement apparatus and a music arrangement method.

[0006]

In order to achieve the above object, the invention according to claim 1 is a program for arranging music to play music in accordance with the progress of a game on a computer, A non-loop target section reading function for reading the data of the non-loop target section in the above, a loop target section reading function for reading the loop target section data in the music, a game progress information obtaining function for obtaining game progress information, A configuration in which a computer implements an arrangement control function of arranging the music so that the non-loop target section is played in accordance with the game progress information, and the loop target section is appropriately added and played according to the progress of the game. There is.

In the invention according to claim 1 configured as described above, the computer reads the data of the non-loop target section in the music by the non-loop target section reading function, and reads the data of the non-loop target section in the music by the loop target section reading function. It is possible to read the data of the loop target section in the music, and when the game progress information is acquired by the game progress information acquisition function, the non-loop target section is adjusted by the arrangement control function according to the acquired game progress information. And arranging the music so that the loop target section is added and played as appropriate according to the progress of the game.

That is, the music itself is divided into a skeleton section and a loop target section that can be played an arbitrary number of times between the sections, and the non-loop target section is not looped based on the game progress information. , While adding a loop target section as needed. The timing to match the game progress information varies depending on the content of the game. If there is an excitement in the middle of the game, the timing may be adjusted. However, in contrast to a generally required example, in the invention according to the second aspect, the game end information is acquired by the game progress information acquisition function, and the end time of the music is determined by the game end information. The music arrangement control function arranges the music so as to coincide with the timing.
Thus, the performance of the music ends at the end of the game. It should be noted that the end of the game does not mean a complete end of the game, but a milestone in one game. Further, the end of the game is not a turning point in a strict sense, and an appropriate margin may be provided depending on the type and content of the game.

[0009] The end timing of such a game is often known in advance depending on the game. For this reason, in the invention according to the third aspect, the game progress information acquisition function acquires the game long time before the start of the game, and the arrangement control function adjusts the playing time corresponding to the game long time. adjust. In the case of a horse racing simulation, all the data is prepared in advance, and it is possible to determine all the developments of the race before starting the race. In this case, the display on the display shows this determined development of the race visually. It just becomes Therefore, the race time can be determined before the start of the race, and the music may be arranged according to the race time as the game progress information.

[0010] On the other hand, even if the game long time is appropriately changed, if the time available in advance is finite, a combination of a non-loop target section and a loop target section may be prepared in advance in accordance with each time. It is possible. For this reason, in the invention according to claim 4, a combination of a non-loop target section and a loop target section is prepared in advance corresponding to a long game time, and the arrangement control function refers to this combination.

By the way, there are various specific techniques for arranging music and adjusting the timing to the progress of the game. As an example, in the invention having the configuration according to claim 5, the sections to be looped are a combination of multiples, and the loop section reading function reads the section with the combination of the multiples, and performs the arrangement control. As for the function, the performance time that is not enough even when the non-loop target section is played is sequentially incorporated from the section having the longest play time in the loop target section. That is, when the short playing time is first obtained, the sections to be looped are compared in order from the one with the longest playing time to the one with the shorter playing time. When the section to be included is determined, the above operation is repeated by subtracting the remaining playing time from the lacking playing time and setting the rest as a new lacking playing time. If the insufficient playing time becomes 0 or becomes shorter than all the loop target sections, the processing ends. That is, only the magnitude comparison and the subtraction are performed as the calculation. Of course, it is also possible to reduce the calculation load using the complement.

By the way, the performance time adjusted by the arrangement control function does not necessarily have to be performed only by the number of repetitions of the loop target section. An error at least as long as the loop target section having the shortest playing time can occur. Even in such a case, in the invention according to claim 6, the playing time is adjusted by changing the tempo by the arrangement control function. In general, it is natural that the performance time can be adjusted by changing the tempo. However, if the tempo is changed, the atmosphere of the performance is changed, so that the performance does not match the content of the game. Therefore, it is preferable to adjust the playing time mainly based on the number of repetitions of the section to be looped, and to change the tempo as a sub-condition with a predetermined range.

Further, regarding such a short-time adjustment,
In the invention according to claim 7, the music arrangement control function adjusts the performance time so that the performance is started at a time different from the start of the game. At the start of the game, if the performance starts earlier or later than the progress of the game, it is not usually strange, and it is more convenient if the music is not previously uncomfortable. In the invention according to the eighth aspect, the music composition is arranged by the music composition control function so as to fade in at the start of the performance. At the start of the game, the attention of the person leans toward the game itself, and a fade-in in which only the game originally starts and the performance is gradually heard may be used. Needless to say, in any case, it is preferable to perform the adjustment for fine adjustment of the playing time as an auxiliary, rather than starting with a large deviation or performing a fade-in. However, since it is an independent means to the last, fade-in or start may be performed in the middle of the game according to the content of the music or the content of the game.

The progress information of the game to be obtained is not necessarily limited to the length of the playing time, and the section to be looped can be selected based on various other information. As an example, in the invention according to the ninth aspect, a game development pattern acquisition function acquires a game development pattern. Then, a loop target section is selected by the arrangement control function according to the development pattern.
The combination of the development pattern and the loop target section may be associated with each other depending on the content of the music, or may be in accordance with the degree of change in the development of the game. As an example, in the invention according to the tenth aspect, the arrangement control function determines whether the development of the game is in a flat tone, and repeats the loop target section in the flat tone portion. Because it is a flat part, even if it is repeated in a loop, it is hard to feel a sense of incongruity.

The unfolding pattern can be used not only for selecting a section to be looped but also for selecting a section to be non-looped. As an example, in the invention according to the eleventh aspect, the arrangement control function selects a non-loop target section according to the development pattern. The non-loop target section is a skeleton of the music, and it may be more convenient to associate a combination of the development pattern and the non-loop target section in advance. For this reason, in the invention according to the twelfth aspect, the database stores the correspondence between the development pattern and the non-loop target section, and refers to this database by the arrangement control function and adds the acquired development pattern to the database. Select the corresponding non-looping section.

Of course, such a program is usually recorded on some kind of recording medium and transferred, and in this sense, it is needless to say that such transfer of the recording medium leads to the use of the invention. Absent. The recording medium in this case may be a magnetic recording medium or a magneto-optical recording medium, and any recording medium to be developed in the future can be considered in exactly the same way. Also, the duplication stages of the primary duplicated product, the secondary duplicated product, and the like are equivalent without any question. In addition, the present invention is not limited to the case where the present invention is used even when the supply is performed using a communication line.

Further, even when a part is realized by software and a part is realized by hardware, the concept of the present invention is not completely different from that of the present invention. It may be in a form that is appropriately read in accordance with it. It goes without saying that the idea of the invention is reflected in the program itself. On the other hand, it can be easily understood that such a program is realized on a substantial computer, and in this sense, the present invention is also applicable to a substantial device including such a computer. Of course, such a music arrangement device may be used alone, or may be used together with another device while being incorporated in a certain device, and the idea of the invention is not limited to this.
It includes various aspects and can be appropriately changed.

Further, in such a music arrangement program, when processing is performed in accordance with such control, it is natural that the invention exists in the procedure, and it is also applicable as a method. Easy to understand.

[0019]

As described above, according to the present invention, it is possible to arrange music in accordance with the progress of a game by providing a section which can be repeatedly played, and to arrange music in accordance with the content of the game. Program can be provided.

Further, according to the second aspect of the present invention, the end of the performance can be coincident with the end of the game, which is effective for improving the atmosphere at the end of the game. Further, according to the third aspect of the present invention, since the length of the game is obtained in advance, it is possible to determine not only the end timing but also the part to be repeatedly played. More flexible arrangements are also possible. Furthermore, according to the invention of claim 4, since a plurality of combinations are prepared in advance according to the length of the game, only the table is referred to when arranging,
The load of the arithmetic processing can be reduced.

Further, according to the invention of claim 5,
Since the playing time of the section to be played repeatedly has a relationship between multiples, it is easy to determine a combination of playing times. Further, according to the invention according to claim 6,
By changing the tempo in addition to the combination of sections to be played repeatedly, more flexible and subtle timing adjustments are possible. Further, according to the seventh aspect of the invention, by changing the timing of the performance start in addition to the combination of the sections to be repeatedly performed, the timing can be adjusted more flexibly and finely.

Further, according to the invention of claim 8,
By changing the performance start timing, it may be shifted from the start of the game, but even in this case, starting with the fade-in does not make the user feel uncomfortable. Further, according to the ninth aspect of the present invention, the development pattern of the game is also used for arranging the music, so that it is possible not only to adjust the time but also to create a music that does not disrupt the game flow. Furthermore, according to the tenth aspect of the present invention, the repeated section is played in a flat tone portion, so that the side executing the game is less likely to notice and can perform without discomfort.

Further, according to the eleventh aspect of the present invention, the non-loop target section corresponding to the development of the game is played, and the development of the game can be further enhanced according to the development pattern. Further, according to the twelfth aspect of the present invention, the unfolding pattern and the non-loop target section are stored in the database.
The selection is easy, and it is easy to upgrade the version. Further, according to the inventions of claims 13, 14 and 15, it is possible to provide a medium recording a music arrangement program having the same effect, a music arrangement apparatus and a music arrangement method.

[0024]

Embodiments of the present invention will be described below with reference to the drawings. In the present embodiment, the present music arrangement program is used to play BGM of a horse racing game. Hereinafter, (1) hardware configuration of the game machine (2) main flow of the horse racing game (3) race data determination processing (4) arrangement processing (i) (5) arrangement processing (ii) (6) arrangement processing ( iii) (7) Arrangement processing (iv) (8) Arrangement processing (v) (9) Race display performance processing (10) Example in which the arrangement processing (i) is applied (11) Arrangement processing (ii) is applied (12) Embodiment in which the arrangement process (iii) is applied (13) Embodiment in which the arrangement process (v) is applied will be described in this order.

(1) Hardware Configuration of Game Machine FIG. 1 is a schematic block diagram showing a game machine to which a music arrangement program according to an embodiment of the present invention is applied. In FIG. 1, a bus 11 includes a main CPU 12 for overall control, a graphic control chip 13 for displaying an image on a television or the like via an I / O 13a, and a BGM and sound effects via an I / O 14a. A control chip such as a sound control chip 14 for outputting an audio signal is connected. Further, an auxiliary storage control chip 15 for controlling an auxiliary storage device such as a CD-ROM drive 15a, a RAM 16 or a ROM 17 serving as a main storage area.
Is also connected. A controller I / O 18 for connecting an external controller 18a for selecting and inputting the progress of the game is connected. In the present embodiment, the present invention is applied to a game machine, but it goes without saying that the present invention is applicable to all computers having the same configuration.

The present music arrangement program is a program for horse racing game B
First, a flow of the horse racing game will be described. (2) Explanation of Main Flow of Horse Racing Game FIG. 2 shows a main flowchart of the horse racing game. After performing various setting processes in step S100, and executing race data determination processing for setting various parameters and the like in order to execute a horse race in step S200, an expected input from a user is received in step S300. . In step S400, a arranging process for arranging music based on predetermined race data is executed. In step S600, a race display performance process for playing BGM, sound effects, and the like while generating a race screen based on the race data. And the last step S
At 700, the score is settled for the expected result. The above flow is only an outline for performing a horse race that requires arranging processing, and in reality, more complicated processing may be executed as a whole horse racing game.

(3) Race Data Determination Processing The flow of the race data determination processing is shown in the flowchart of FIG. In step S210, settings relating to the race track are performed. Referring to the flowchart of FIG. 4, the weather is determined in step S212, the distance is determined in step S214, and the situation of the riding ground is determined in step S216. The weather is provided with a weather database in FIG. 5, and the weather database records changeable elements of weather, temperature, and wind. For weather, there are "fine", "rain", and "cloudy" elements. For temperature, there are "hot", "normal", and "cold" elements. For wind, "no", "weak", There is each element of "strong". Of course, these are only examples, and each may be represented by a numerical value. For example, if it is expressed in a range of “0 to 255”, “0” indicates a downpour rain, and “255” indicates a fine weather. In the same numerical range, the temperature also indicates "0 degree" to "40 degree", and the wind also indicates "0 m" to
It may be said to represent "40 m". Note that a wind direction element may be added.

As for the distance, a distance database is provided in FIG. 6, and the distance is determined with reference to the distance database. Here, "1600 m", "2000
Although each element of “m” and “3200 m” is provided, the distance may be represented by a numerical value in the range of “0 to 255”. However, it is necessary to set the distance of the race track to, for example, a distance of "100 m" so that a fraction does not appear.

As for the riding ground, FIG. 7 includes a riding ground database, and the distance is determined with reference to the riding ground database. Here, "good", "somewhat heavy",
It has elements of “heavy” and “bad”. Regarding the degree of the riding ground, "0" to "2"
It may be expressed in such a manner that the degree of failure decreases within the range of 55 ”. After the data on the racetrack is set, the participating horses in the race are determined in step S220. Referring to the flowchart of FIG. 8, in step S222, the rank of the race is determined using random numbers. Regarding the race rank, the database for the race rank is provided in FIG. 9, “not won”, “5 million yen or less”, “9 million yen or less”, “16 million yen or less”, “open G1”, “open G2 ”and“ open G3 ”. The number of horses running may be determined in relation to the race rank.

In the following step S224, runnable horses are extracted with reference to the race horse database shown in FIG. 10, and are randomly selected from the race horses extracted in step S226. There are various parameters in the racehorse database, but the basic ones are "escape", "preceding", "sign", " It records the type of "running in" and classes for identifying races that can run. Of course, other data such as the type and age of "Thoroughbred" and "Arab" are recorded.

On the other hand, in this racehorse database,
The strengths and weaknesses of the items determined by the race track data are recorded. That is, in the case of weather, a three-level evaluation is recorded from what each race horse is good at to what it is not good at, and the weather 1 data of the race horse is “clear” and the weather 2 data is “ Assuming that the data of the cloudy weather and the weather 3 is “rain”, if the weather of the race track data is “clear”, it will be “+2 points”, and if it is “cloudy”, it will be “+2 points”.
1 point "and" -2 points "for" rain ". In this manner, the point data is determined for other weak points, and is used as a reference for the speed at which the race horse runs in the race.

In the present embodiment, “+2 points” are assigned to the first item of each item, “+1 point” is assigned to the second item, and “−2 points” is assigned to the third item. Can be changed as appropriate. For example, all the elements that can be taken for each item and points corresponding to the elements may be added to set the parameters more subtly. After the race horse is determined, the race space is determined in step S230. The race space is either "slow pace", "normal" or "high pace", and this race space has different effects for each type of race horse.

FIGS. 11 to 14 show the speed at the time of a race for each type in five stages. FIG. 11 shows a running speed of the "escape" type. After starting, the speed is increased to five stages, and when the vehicle goes beyond the first corner, the speed is reduced to two stages, and the vehicle proceeds to the goal. FIG. 12 shows a "preceding" type of traveling speed. After the start, the speed is increased to four stages, the speed is reduced to two stages when the vehicle goes beyond the first corner, and the speed is gradually increased after passing the third corner. In the goal, speed up to 3.5 steps. FIG.
This is a type of running speed. After starting, increase the speed to 3.5 stages, reduce the speed to 2 stages when passing the first corner, gradually increase the speed after passing the 3rd corner, 4 Increase speed up to .5 steps. FIG. 15 shows the “running-in” type of running speed.
The speed is increased to the next stage, the speed is reduced to two when the vehicle passes the first corner, the speed is gradually increased from the fourth corner, and the speed is increased to five for the goal. Of course, these are models for simplifying the description, and are actually in a complicated form by delicate data.

The solid lines in FIGS. 11 to 14 show the case where the race space is “normal”, the one-dot chain line shows the change in running speed in the case of slow pace, and the two-dot chain line shows the change in speed in the case of high pace. Is shown. In the case of a slow pace, there is little fatigue, so the speed rises at the end, and in the case of a high pace, there is much fatigue, so that the speed growth rate decreases at the end. Once the race space is determined, step S24
0 determines the race situation of each horse. FIG. 15 shows the specific procedure. In step S242, a pointer variable N is set to "1", and in step S244, data of a change in traveling speed determined based on the type and race space for each participating race horse. And determine the running position during the race by reflecting the points calculated in the weak points. For example, assuming that the race horse (1) is of the "leading" type and the race space is of "high pace", the basic running speed is as shown by a two-dot chain line in FIG. The running speed indicated by the two-dot chain line is only basic, and the running speed is changed using random numbers and points. That is, when the point is high, the traveling speed at each position tends to increase, and when the point is low, the traveling speed tends to decrease. However, since the element to be changed is a random number, there is a case where it is proportional to a point in macro terms, but opposite in micro terms.

When the running speed is determined, "1" is added to the pointer variable N in step S246, and the remaining race horses are repeated with reference to the variable N in step S248 until it is determined that the previous game has ended. After determining the running speeds for all the race horses, the race development is determined in step S250. FIG. 16 is a flowchart showing the race development determination process. In step S251, a process of superimposing the race status of each horse is executed. In step S244, since the running speed during the race has been determined for each horse, the running position for each horse as shown in FIG. 17 is determined based on the speed, and the positions of all the race horses during the race are determined. Overlap. FIG. 17 shows the travel positions of each type of “escape”, “preceding”, “insert”, and “run in” when the traveling speed is not changed by random numbers. In the figure, the vertical axis indicates the traveling position, and the horizontal axis indicates the time course. In the case where there is no influence from other factors, the start position and the goal position are set to be the same regardless of the type, and it can be seen that the victory rate by type is basically not biased. On the other hand, by reflecting the type, race space, and points described above, the running position changes, and the order of arrival at the goal also changes.

When such a running position is determined, it is determined in steps S252, S254, and S256 whether or not there are exciting scenes of the race in the first half, the middle, and the second half. FIGS. 19, 20 and 21 show the excitement factors for determining whether or not the race has an excitement in each of the first half, the middle and the second half. This shows the actual situation of excitement in a horse race, and if the excitement factor was in the first half, the pace of the "escape" type horse was fast and the difference between "running" and "run in" was widened significantly There are cases. In addition, there are cases where "escape" type horses are late, or "leading" type horses are unexpectedly deployed ahead of "escape" type horses. .

Similarly, if the factor is an intermediate excitement factor, a fall may occur. If the factor is a late excitement factor, the pace of the "running-in" type horse is very fast and the "runaway" type horse is overtaken earlier. "Dango" where each horse is almost in a horizontal line
There are cases such as the state. As for the excitement factor, a plurality of conditions can be set for each part, and if any one of them is satisfied, the part is regarded as excitement, and in steps S253, S255, and S257, FIG. Set the climax flag shown in. In step S258, the running times of the first half part, the middle part, and the second half part are set based on the data shown in FIG. This running time will be used later when determining the playing time. Further, in step S260, data of the race is determined by determining the winning or losing of the race based on the data. The race data is determined for each race as described above.

(4) Arrangement processing (i) Various arrangements are made such as whether the arrangement processing is simply performed for a music piece having a length corresponding to the race time or to a point where a music piece is generated according to the development of the race. is there. Here, the simplest method will be described sequentially. The arrangement processing program and various software and hardware for executing the arrangement processing are organically combined to constitute an arrangement control function, a non-loop target section read function, a loop target section read function, and a game progress information acquisition function. ing.

FIG. 22 shows a process for adjusting the end of the music performance to the end of the race. Step S402
Now, get the game manager's time. The game length time coincides with the sum of the times of the parts in the table shown in FIG. Therefore, when the time of each part is obtained, the total is calculated to be the game long time. Step S
In 404 to S408, the corresponding section data is acquired for each part by referring to the section database shown in FIG. In the database shown in FIG. 3, "section number", "looping availability", "corresponding part", "boom" are provided for each section data to which identification IDs "A", "B",. Data corresponding to items such as "correspondence", "pacing correspondence", and "race rank" are recorded, and various types of narrowing and extraction can be performed.

In this case, the content of the music is not adjusted according to the music, but the playing time of the music is merely adjusted to the game length. Therefore, the predetermined section data is selected from the identification IDs "A" to "E". Is read. Here, the item of “loopability” will be described. In the present invention, a loopable section is called a loop target section, and a non-loopable section is called a non-loop target section. The loop target section and the non-loop target section correspond to each part according to the tone and mood of the song, and the corresponding relationship is recorded in items such as "support for excitement", "support for pace", and "race rank". For example, as for the item of “support for excitement”, when the race is excited in each part, the music with a more gorgeous atmosphere matches. If the section has such a gorgeous atmosphere, data “1” is recorded in the item of “support for excitement”. Also, data “0” is recorded for a song without such a gorgeous atmosphere.

Next, regarding the item of “pacing”,
If the race is progressing at "high pace", the songs that make you feel fast even at the same tempo will match, and if the race is "slow pace", you will feel like you are progressing a bit slower The song that it represents matches. Therefore,
If the section gives a sense of speed, data of “1” is recorded in the item of “corresponding to pace”, and if the section expresses the feeling of slow eyes, data of “0” is recorded.

The item of "race rank" is used when a music piece is selected according to the race rank.
When the BGM of a race such as G2 or G3 wants to make the music more dignified and dignified, the music can be selected by the race rank. Therefore, the matching race rank is recorded for each section in the “race rank” column.

It should be noted that each data does not necessarily have to match the race in all items, and it is possible to narrow down the data by setting conditions that should match in the arrangement. It is determined whether the data in each section is to be looped or not. A non-loop target is a condition that is not suitable for being repeatedly played, and is generally close to an independent song. Basically, the tone is suitable for the first half, the middle part, and the second half. The first half and the middle part each have loop target section data corresponding to the non-loop target section data, and the loop target section data has a tone that does not make you feel uncomfortable even if you play repeatedly. I have. Basically, the non-loop target section data can be continuously formed without a sense of incongruity even without the loop target section data. The asymmetric loop section data has a longer playing time, and the loop target section data has a shorter playing time. Referring to the example of FIG. 23, the identification IDs “A”, “C”, and “E” are non-loop target sections, and the number of quarter notes is “34”, “40”, and “36”, respectively. On the other hand, the identification IDs “B” and “D” are sections to be looped,
The number of quarter notes is "8" and "4", respectively.

In the case of a horse racing game, there are a first half part, an intermediate part, and a second half part, and data of a non-loop target section corresponds to all parts, while data of a loop target section includes a first half part and a middle part. ing. This is important because the last part requires time alignment, and it doesn't make much sense to repeat the data in the looped section after the data in the non-looped section is over. Because.

When the music is arranged only for a long time in the game, steps S404 and S404 are performed for simplicity.
In steps 406 and S408, the corresponding non-loop target section data is determined for the first half part, the middle part, and the second half part, and the non-loop target section data having the identification IDs "A", "C", and "E" are obtained. Then, in step S410, the total playing time of the non-loop target section data is calculated. When the race space is “normal”, the tempo is “120”. And the identification ID
Since the number of quarter notes in the non-loop target section data of “A”, “C”, and “E” is 34 + 40 + 36 = 110, the playing time is (110/120) minutes. The performance time does not necessarily have to be calculated in minutes,
The process may proceed with the number of quarter notes.

In the next step S412, the total playing time is compared with the game long time to determine whether there is any extra time.
If there is extra time, step S41
At step S4, the loop target section data having the identification ID "B" corresponding to the non-loop target section data having the identification ID "A" is obtained, and at step S416, the total playing time at this time is calculated again. The loop target section data having the identification ID "B" has the number of quarter notes "8", and the total playing time is (118/120) minutes.

Thereafter, in step S418, it is determined again whether or not there is an extra time.
At 420, the loop target section data with the ID “D” corresponding to the non-loop target section data with the ID “C” is acquired. However, in this case, step S41
6, the total playing time at this point is not recalculated. This is for simplifying the process, and assuming that all the data to be acquired has been acquired, fine adjustment described later is performed to adjust the balance.

The fine adjustment process is performed as step S424 when it is determined in step S422 that there is no time difference. Here, the time difference in step S422 means that there is a difference between the total performance time of the acquired section data and the game long time. Therefore, if the performance is performed with a time difference, the timing of ending the game and the timing of ending the performance will not match. FIG.
Shows a flowchart of the fine adjustment process, and two major methods are correction of tempo and execution of fade-in. Fade-in is a method of shifting the performance start timing from the game start timing, so that the tempo does not have to be corrected, but the start of the game cannot be matched with the start of the performance. On the other hand, if the tempo is modified, the performance is started at the start of the game, and the performance can be ended at the end of the game. However, the tempo changes, though in a small range.

In step S430, it is determined whether or not the fade-in priority has been specified. If no priority has been specified, the total playing time is calculated in step S432. In the above example, in addition to the non-loop target section data of the identification IDs “A”, “C”, and “E”, the identification IDs
Since the loop target section data of "B" and "D" has also been acquired, the total performance time is 122 in quarter notes. Assuming that the game long time acquired in step S402 is 1 minute, the ratio with the game long time is obtained in step S434 (122/120), and step S43 is performed.
Same as tempo correction data at 6 (122/120)
Is output.

When the fine adjustment processing is completed, step S42
In section 6, the edited data is output. In the case of the above example, section data of identification IDs "A" to "E" is output. That is, in the arrangement process at step S400, tempo correction data is output at step S436, and section data is output at step S426. The above is the simplest arrangement processing (i). (5) Arrangement Process (ii) Next, an arrangement process capable of selecting section data to be read in accordance with the development pattern of the game will be described. FIG. 30 is a flowchart showing this arrangement processing.

In step S450, a game development pattern is obtained. The game development pattern is a change mode of the excitement as shown in FIG. In other words, in the case of a part having an excitement, an optimal non-loop target section is selected by referring to the excitement flag in the following in order to make the musical piece with a tone that makes the excitement real. In step S452, the time of the game length is obtained in the same manner as in step S402. Here, the time and time of each part are acquired. As a result, all the information shown in FIG. 18 is used in the main arranging process.

In step S454, non-loop target section data of the first half, the middle part, and the second half corresponding to the game development pattern is obtained. This process is shown in FIG.
The section database reference processing shown in FIG.
Many section data are recorded in the section database as shown in FIG. 23, and data matching is performed according to the purpose of use. Regardless of game development,
In this section database reference processing, step S4
At 70, narrow down by race rank. The race rank is determined in step S272, and is narrowed down to section data having different atmospheres according to the importance of the race. Next, in step S472, narrowing is performed based on whether or not the object is a loop. Since the purpose of referring to the non-loop target section data is to be referred to in step S454 that calls this database reference process, the process is narrowed down to the non-loop target section data here. Referring to FIG. 23, the race rank is recorded sixth from the top as an item name, and whether or not a loop is possible is recorded third, and narrowing down is performed based on these items. The narrowing down so far is common to the first half part, the middle part, and the second half part, and thereafter narrowing down is performed according to each.

That is, in step S474, the corresponding part is the "first half part", and the section data is narrowed down to the section data that matches the excitement flag of the first half part read as the development data. If there is a plurality in this state, the refinement is released by one stage while selecting at random in step S476. Referring to FIG. 23, since the corresponding part is recorded fourth from the top as the item name and the excitement correspondence is recorded fifth, the narrowing is performed with reference to these. If the narrowed down section data is singular, only that section data is substantially selected, the narrowing down is released by one stage, and the process returns to the end state of step S472.

Subsequently, in the same manner, narrowing down is also performed on the intermediate part in step S478 using the developed data, and in step S480, any one section data is selected. Step S for the latter part
In step 482, it is determined whether or not the target section is the non-loop target section. Only in the case of the non-loop target section, while narrowing down is performed in step S484, step S48
In step 6, any one section data is selected.

Then, finally, in step S485, all the refinements are released, and the process ends. Since the non-loop target section for each part is obtained as described above,
In 456 and S460, loop target section data is acquired depending on whether or not there is a surplus time. For the first half part, first, it is determined in step S456 whether or not there is any extra time. In this case, the performance time read with reference to FIG. 18 is used. In the previous example, the total playing time and the game long time were compared. Here, the surplus time is calculated for each part, and if there is a surplus time, the loop target section data is used in step S458 by using the section database reference processing. To get. For the intermediate part, the remaining time of the intermediate part is calculated in step S460, and if it is, the loop target section data is acquired in step S462 using the section database reference processing.

For example, suppose that the time of the first half part is "40" in quarter note number, and if the non-loop target section data of the first half part is "34" in quarter note number, extra time is generated and the loop target You will get section data. When the non-loop target section data and the loop target section data are obtained for each part as described above, the game long time is compared with the total playing time of the section data in step S464, and if they do not match, in step S466. Perform fine adjustment processing. Thereafter, in step S468, the acquired section data is output as arrangement data.

(6) Arrangement processing (iii) In the arrangement processing (iii), the loop target section data is added only to the part lacking excitement. FIG.
This arrangement process is shown by a flowchart. The process of acquiring the game development pattern and the process of acquiring the game long time performed in steps S490 and S492 are the same as those in steps S450 and S452.
The process of acquiring the non-loop-compatible section data by referring to the section database at 94 is also the same as in step S454.

In the following step S496, the total playing time is calculated based on the non-loop corresponding section data, and in step S498, it is determined whether or not there is any extra time as compared with the game long time. If there is extra time, step S
At 502, it is determined whether there is a non-uplifting part, that is, whether there is a part for which the uplift flag is not set, and if so, at step S504, loop target section data corresponding to the part is acquired.

For example, there is no climax in the first half part,
If the middle part swells, it is considered that the first half part has a relatively flat tone, and a loop target section is incorporated at the end of the first half part so that there is no extra time.
However, when both the first half part and the middle part have a climax, it is generally considered that the climax degree of the middle part is lower, and the loop target section data corresponding to the middle part is acquired in step S506.

On the other hand, in this arrangement process, although the part into which the loop target section data is incorporated is fixed, it does not always eliminate the extra time. Therefore, the number of loops of the loop target section is determined in step S508. For example, if the remaining time is 10 quarter notes and the playing time of the loop target section of the intermediate part is 4 quarter notes, the minimum number of repetitions that can eliminate the remaining time is “3”. ”Times, and this is determined as the number of loops.

When the non-loop target section data, the loop target section data, and the number of loops are determined in this way, the total playing time is compared with the game long time in step S510, and if they do not match, the fine adjustment processing is performed in step S512. Is performed, and the arrangement data is output in step S514. (7) Arrangement processing (iv) The arrangement processing (iv) shows a universal flowchart for determining the number of loops of the loop target section for each part, corresponding to the game development. For the sake of universality, the parts are not limited to the three parts of the first half, the middle, and the second half, but can be increased, and the variables are sequentially represented by the variable N from the first part to the last part.

In steps S520 and S522, a process of acquiring a game development pattern to be executed and a process of acquiring a game long time are executed. However, the number of parts is not three as described later, and the table of the development pattern shown in FIG. 18 is a table corresponding to all parts. In step S524, the pointer variable N indicating the part is initially set to "1", which is a preparation for the loop processing executed in steps S526 to S536.

In step S526, the data of the non-loop target section of the part (N) corresponding to the game corresponding pattern is obtained by using the section database reference processing. In step S528, whether the part (N) has extra time or not is obtained. Determine whether or not. More specifically, the performance time is calculated based on the number of quarter notes of the non-loop target section data, and the time of the part (N) corresponding to FIG. 18 is obtained and compared. If there is extra time, the loop target section data corresponding to the expanded data of the part (N) is acquired using the section database reference processing in step S530. Then, in step S532, the number of loops is determined so that there is no extra time.

Regardless of whether there is any extra time, step S
In step 534, “1” is added to the pointer variable N, and step S
The above processing is repeated until it is determined at 536 that the processing has been repeated up to the total number of parts. Through the above processing, appropriate non-loop target section data is selected for each part, and if necessary, loop target section data that does not cause much time is selected, and the number of loops is determined. Thereafter, in step S538, the total playing time of all the section data determined as described above is calculated in quarter notes or time units.
At 40, it is determined whether or not there is a time difference compared with the entire game long time, and if there is a time difference, step S542 is performed.
Performs fine adjustment processing. Regardless of whether there is a time difference, the arrangement data is output in the last step S544.

(8) Arrangement Processing (v) In the arrangement processing (v), the arrangement processing is performed when a plurality of loop target section data having different playing times are prepared for each part. In other words, a plurality of loop target section data having different numbers of quarter notes are prepared while corresponding to the non-loop target section data, and if the remaining time is long, the loop target section data having a longer playing time is sequentially started. Perform processing for use.

In step S550, the game long time is acquired. In step S552, the non-loop target section data of the first half, the middle part, and the second half is acquired.
In step S554, the total playing time based on the non-loop target section data is calculated. In a succeeding step S556, it is determined whether or not there is a surplus time. If there is a surplus time, the loop target section which is shorter than the surplus time and has the maximum performance time is corresponded to the non-loop target section data of the intermediate part in a step S558. Get the data. In this case, the section database is narrowed down by the race rank, narrowed down by being a loop object, and finally narrowed down to one that matches the development data of the intermediate part.
Since a plurality of corresponding section data having different playing times are registered as the corresponding loop target section data, they are sequentially referred to in descending order of playing time.

More specifically, it is assumed that there are three quarter note numbers "16", "8", and "4" as the section data to be looped, and the remaining time is "30" in quarter note numbers. ", The first thing to be obtained is that when the section database is referenced, the number of quarter notes is" 16 ".
Individual ”. Subsequently, in step S560, the total playing time is calculated, and the process returns to step S556 to calculate the remaining time. In the previous example, although the first remaining time was “30” in quarter note number, the remaining time was “14” in quarter note number because the loop target section data having “16” quarter number was added. (= 30-16) pieces ". Therefore, the next time step S558 is executed, loop target section data having a quarter note number of "8" is added, and then loop target section data having a quarter note number of "4" is added. Finally, the remaining time is "3" in quarter notes, and there is no loop target section data shorter than the remaining time.

As described above, since the playing time of the section data to be looped has a relationship of being a multiple of each other, the playing time is examined from the longest playing time and the one having the shorter playing time is selected. As a result, only the remaining time shorter than the shortest playing time can be left at the end, and the selected loop target section data does not overlap. Therefore, when preparing the loop target section data for time adjustment, Work can be reduced relatively, and arrangement without discomfort becomes possible.

Of course, in this sense, the loop target section data will not be repeatedly played, but even in such a case, if the loop target section data is added for time adjustment and does not cause any discomfort, the function of the loop target section data is used. It can be said that it fulfills enough. On the other hand, if the process exits the loop with the remaining time remaining, it is determined that there is a time difference in step S562, and a fine adjustment process is performed in step S564. Finally, at step S566, the arrangement data output process is executed.

(9) Race Display Performance Process Returning to FIG. 2 upon completion of the arranging process, the next process is the race display performance process based on the above parameters. FIG. 35 is a flowchart showing details of the race display performance process. In step S602, music arrangement data is obtained. Since the arrangement data is generated in any of the arrangement processes and stored in the storage area of the RAM 16, the arrangement data is read and acquired. Next step S
In step 604, if the fade-in data is generated in the fine adjustment process, it is acquired.

In the above description of the fine adjustment processing, the fine adjustment based on the tempo is performed, and the processing for generating the fade-in data will be described. In FIG. 29, step S430
When it is determined that the setting of the fade-in priority has been made in step S438, it is determined in step S438 whether or not there is extra time.
In the other arranging processes other than the arranging process (v), the section data to be looped is obtained as long as there is extra time. There is no. Then, step S44
At 0, the data of the first bar in the first non-loop target section data is cut, and step S438 is performed again.
Return to and determine whether there is extra time. When this is repeated, the loop is exited when the extra time within one bar occurs, and the total playing time is calculated again in step S442.

In the next step S446, the offset amount of the start time is determined. In the above processing, the total playing time is shorter than the game long time, and it is necessary to delay the playing start timing in order to match both end timings. This delay time is the offset amount, and the calculation is (offset amount) = (game long time) − (total playing time). Then, in step S448, this offset amount is output as fade-in data.

It should be noted that it does not matter whether the fine adjustment is made by the fade-in or the tempo by the tempo, and may be appropriately determined according to the atmosphere of the music. Accordingly, as an example, if the non-loop target section data of the first half part is suitable for fade-in, it is possible to record the section data in the section database in advance and set the fade-in priority. Returning to the flowchart of FIG. 35, if the fade-in data has been output in the fine adjustment processing as described above, it is recorded in a predetermined area of the RAM 16, so it is acquired in step S604. Since the tempo correction data is recorded in the predetermined area of the RAM 16, it is obtained in step S606.

Based on this, it is determined in step S608 whether or not there is tempo correction data.
Correct the tempo with 0. In step S612, it is determined whether or not there is fade-in data.
At step S14, a performance start offset is set and step S
At 616, the fade-in speed is set. The performance start offset indicates how long after the start of the race the performance starts, and the fade-in speed indicates the time for increasing the volume from "0" to the normal volume. Although the performance start offset is indispensable, a default time may be set for the speed at which the volume is increased.

The preparation for the transfer of the performance data is prepared as described above, and the control data is actually transferred to the sound control chip 14 in step S618.
The control data includes a tempo, a performance start offset and a fade-in speed, as well as a RAM in which arrangement data is recorded.
16 start address and length. After this notification, the graphic control chip 13
Therefore, the performance and the display proceed simultaneously to instruct the execution of the race drawing process.

Note that the performance data is actually
Since it is possible to use a method of sequentially reading data from the D-ROM when necessary, the arrangement data may be information indicating a recording position on the CD-ROM. (10) Embodiment to which Arrangement Processing (i) is Applied Next, the operation of this embodiment having the above configuration will be described.
When the horse race prediction game is started, the process proceeds according to the flowchart of FIG. In step S100, general preparation processing such as designating variables for progress of the game or designating an area is executed.
Generates data for executing the race. Although the progress and results of the race have already been determined at this point, step S
In the process of accepting an expected input at 300, only information before the race is shown to the user, and an expected input of a winning horse from the user is accepted.

After the prediction input, in order to perform the performance while displaying the race, in step S400, the music to be performed is arranged. Hereinafter, a process in which a race time is designated and the corresponding arrangement is performed will be described. Note that the basic tempo is 120. Assuming that the length of the race is 60 seconds, when the arrangement process (i) shown in FIG. 22 is executed,
In step S402, a game long time of "60 seconds" is acquired. In step S404, non-loop target section data A for the first half part is acquired.
In step S408, non-loop target section data C is obtained for the intermediate part, and in step S408, non-loop target section data E is obtained for the second half part. Step S410
Now, these non-loop target section data A, C, E
Is calculated. When calculated by the number of quarter notes for simplicity of calculation, 34 + 40 + 36 = 110 is obtained. Since the game long time is 60 seconds and the number of quarter notes is 120, it is determined in step S412 that the total playing time is shorter and has extra time.
Section 4 non-loop target section data A for the first half
To obtain the loop target section data B corresponding to.
Subsequently, when the total playing time is calculated again in step S416, the total playing time becomes 110 + 8 = 118, and there is a surplus time. Therefore, in step S420, it corresponds to the non-loop target section data C for the intermediate part in step S420. Acquire loop target section data D.

Subsequently, in step S412, it is determined again whether there is extra time, and if there is extra time, loop target section data corresponding to the first half part and the intermediate part is obtained again as described above. If there is no remaining time, the total playing time is compared with the game time in step S422. Since the total playing time is 118 + 4 = 122, the two do not match, and a fine adjustment process is executed in step S424. As shown in FIG. 29, in the fine adjustment process, if the fade-in is not prioritized,
In step S432, the total playing time is calculated, and in step S434, the ratio to the game long time is calculated. This ratio becomes (122/120), and is output as tempo correction data in step S436.

On the other hand, if the fade-in is prioritized, it is determined in step S438 whether there is any extra time. In this example, it is determined that there is no extra time because the total playing time is longer than the game time. Is done. Therefore, the data of the first bar is cut in step S440.
In this example, it is the first bar in the non-loop target section data A for the first half part. Then, when recalculating the total playing time in step S442, "4" is subtracted by the number of quarter notes, the remaining time becomes 120-122-4 = 2, and it is determined in step S438 whether there is any remaining time. Then, it is determined that there is extra time, and step S44 is performed.
Proceed to 6.

In step S446, "2" is determined as the offset of the start time, and in step S448, it is output as fade-in data. When the fine adjustment processing is completed, the process proceeds to step S426 in FIG. 22, and section data A, B, C, D, and E are output as arrangement data. However, in the case of fade-in priority, section data A
The first bar in is cut. Thus, the arrangement process ends, and the race display performance process of step S600 shown in FIG. 2 is performed. As shown in FIG.
In step S602, arrangement data is acquired, and in step S602
In step 604, fade-in data is acquired, and step S6 is performed.
At 04, tempo correction data is obtained.

When the priority is not given to the fade-in, it is calculated in step S434 (122/120).
Exists, and the tempo is corrected in step S610 after the determination in step S608. In this example, since the reference tempo is “120” and the correction data is “122/120”, when both are multiplied, the result is 120 × (122/120) = 122, and the tempo is played as “122”. As a result, the performance of the arrangement data is completed in 60 seconds.

On the other hand, if priority is given to fade-in,
The fade-in data “2” output in step S448 exists, and after the determination in step S612, “2” is set as the performance start offset based on the fade-in data in step S614 in step S614. Set the fade-in speed. In the arrangement data in the case of the fade-in priority, the first bar in the section data A is cut, and when the performance is started with a delay of "2" from the start of the game, the performance end timing is "2 + 118 = 120". Therefore,
If the performance is performed at the tempo 120 as it is, the performance ends in 60 seconds, which coincides with the game long time.

In step S618, the data relating to the performance described above is transferred to the sound control chip, and in step S6
At 20, a race drawing process is executed. On the other hand, when the game long time is 61 seconds, step S shown in FIG.
Section data A to E through the processing of 402 to S420
Is obtained. Here, returning to step S412, when the total playing time is calculated, the number of quarter notes is 122. However, when the tempo is 120, the game long time of 61 seconds is 122 in quarter notes, so there is no extra time. . In step S422, it is also determined that there is no time difference in this example, and the race display performance processing is executed in step S600 without performing the fine adjustment processing.

Next, when the game length is 65 seconds, the section data A to E are obtained through the processing of steps S402 to S420, and the procedure returns to step S412 to calculate the total playing time. However, if the tempo is 120, the game long time of 65 seconds is
Since the number of quarter notes is 130, the remaining time is "8". Therefore, in step S414, the loop target section data B of the first half part is acquired again, and step S416 is performed.
Recalculate the total playing time. The section data B has a time of “8” in quarter notes, and if it is determined in step S418 whether there is any extra time, there is no extra time and there is no time difference. Therefore, without fine tuning, the tempo is 1
Arrangement data of section data A, B,
B, C, D, and E.

Next, when the game long time is 66 seconds, similarly, when the section data A to E are obtained, the total playing time becomes 122 in quarter notes, and the step S
When the loop target section data B is obtained at 414, the total playing time becomes “130” in quarter notes. On the other hand, since 66 seconds is the number of quarter notes of “132”, if it is determined in step S418 whether or not there is extra time, “2”
Thus, there is extra time, and the loop target section data D is acquired in step S420, and the total playing time becomes "134". Therefore, there is no remaining time, and a time difference occurs, so that a fine adjustment process is executed in step S424. When the fine adjustment process is performed, step S43
In step 4, the ratio of the game long time "132" to the total playing time "134" is calculated, and in step S436, tempo correction data of (134/132) is output.

Then, the reference tempo “120” is multiplied by the same ratio (134/132), and the tempo becomes “121.1”.
818 ... ". As described above, based on the game long time, while obtaining non-loop target section data from the first part, if there is extra time, obtain loop target section data from the first part, By correcting the misalignment by the fine adjustment processing, the end of the performance and the end of the game can be synchronized even in a development in which the game length is essentially unknown.

Finally, when the arrangement data is output in step S426, the race display performance processing is executed in step S600 and thereafter, and in step S700, the score is settled by comparing the prediction with the arrival order. In the above example, a method is adopted in which new loop target section data is sequentially acquired after the game long time is determined and the time is adjusted. However, as shown in FIG. 36, the non-loop target section data, the loop target section data, and the tempo are combined in a table in advance according to the game long time, and the section data and the tempo are determined immediately from the game long time. May be.

That is, in the arranging process in step S400, the game long time is acquired, and the table shown in FIG. 36 is immediately referred to. Already 60 seconds, 61 seconds, 65 seconds,
Since 66 seconds has already been described, here, verification is performed for 62 seconds to 64 seconds, respectively. In the case of 62 seconds, the arrangement data is section data A, B, C, D,
D and E. When the total playing time is represented by the number of quarter notes, it is "126". 62 seconds when the tempo is set to "120" is "124" when represented by the number of quarter notes. Therefore, the total playing time “126” and the game long time “12”
The ratio (126/124) to the basic tempo “12”
0 "must be multiplied. Therefore, 120 × (126/124) = 121.93554839, which is as shown in the table.

In the case of 63 seconds, the arrangement data is the same as in the case of 62 seconds, and the total playing time is "126" in quarter notes.
Becomes 63 seconds when the tempo is set to 120 is "126" when represented by the number of quarter notes, which is the same. Therefore, the tempo may be kept at “120”, which is as shown in the table.
In the case of 64 seconds, the arrangement data is section data A, B, B, C, D, and E. When the total playing time is represented by the number of quarter notes, it is "130". 12 tempo
64 seconds when it is set to 0 is "128" when represented by the number of quarter notes
Becomes Therefore, the ratio (130/128) of the total playing time "130" and the game long time "128" must be multiplied by the basic tempo "120". Therefore, 120 × (130/128) = 121.875, which is as shown in the table.

(11) Embodiment Where Arrangement Processing (ii) is Applied Next, a case where the arrangement processing (ii) shown in FIG. 30 is performed as the arrangement processing will be described. In this arrangement process (ii), a game development pattern is referred to. The detailed description of the process of generating the game development pattern is omitted, and it is assumed that the determined game development pattern is as shown in the table in FIG. After receiving the expected input in step S300, the arrangement process is executed in step S400, the game development pattern is read from the table shown in FIG. 18 in step S450, and the game length determined in the race data determination process is determined in step S452. Get time.

In step S454, the non-loop target section data of the first half, the middle part, and the second half corresponding to the game development pattern is obtained. More specifically, with respect to the data narrowed down in steps S470 and S472 of the section database reference processing shown in FIG. (Steps S474 and S476), narrowing down the non-loop target section data, which has a climax of "0" for the middle part, and selects one of them (steps S478 and S480). And selects one of them (steps S484 and S484).
486). Each of these items is narrowed down and selected by referring to the item of the race rank, the item of the loop availability, the item of the corresponding part, and the item of the excitement based on the section database shown in FIG. For example, the race rank is “16 million or less”, the loop availability is “0” for non-looping, and the corresponding part is “first half”.
Then, when the excitement is narrowed down under the condition of “1”, the section data with the identification ID H is a selection candidate. If there are a plurality of sections having the same condition in the section database, they are selected at random from among them, but if there is only one section data, this section data H is the section data for the first half part. The same procedure is performed for the middle part and the second half part.

On the other hand, if the time of the first half part is 10 seconds as shown in FIG. 18, the number of quarter notes when the tempo is 120 is "20". Since the section data H is "16" in quarter notes, it is determined in step S456 that there is extra time, and in step S548, the loop target section data is selected under the same conditions as the first half part. That is, the race rank is "16 million or less"
Thus, the condition of the loop is “1” to be looped, the corresponding part is “first half”, and the excitement is “1”. Then, section data J and the like in FIG.

When the loop target section data is selected for the intermediate part in the same procedure, step S464
, The presence or absence of a time difference is determined, and if there is a time difference, the above-described fine adjustment is performed. Finally, when the arrangement data is output in step S468, the race display performance processing is executed in step S600 and subsequent steps. By the way, in the above-described section database reference processing, although the race space is not narrowed down, the atmosphere of the music can be changed according to the race space. In that case,
The race space determined in step S230 of the race data determination process shown in FIG. 3 may be referred to, and when referring to the section database shown in FIG. 23, the items corresponding to the pace may be narrowed down.

(12) Embodiment Where Arrangement Processing (iii) is Applied Next, a case where the arrangement processing (iii) shown in FIG. 32 is performed as the arrangement processing will be described. This arrangement process (iii
In), the loop performance section data is added to only the part having no climax with reference to the game development pattern, and the performance is repeated. It is assumed that the game development pattern has already been generated as in the table shown in FIG. Arrangement processing is executed in step S400, and step S49 is performed.
0, the game development pattern is read out, and step S4
At 92, the game long time determined in the race data determination processing is acquired. In step S494, non-loop-compatible section data corresponding to each part is obtained, and step S494 is performed.
At 496, the total playing time is calculated.

In step S 496, the game long time is compared with the total playing time.
At 8, it is determined whether or not there is a non-climbing part.
The non-uplifting part is, in other words, a flat part, and in this embodiment, refers to a part in which the uplifting item shown in FIG. 18 is set to “0”. For parts without swelling, BGM is more compatible with a flat feeling,
Furthermore, if you want to add a part that plays repeatedly,
This is because it is considered that it is better to add a flat tone part to a part with high climax.

If there is a part for which the excitement item is set to "0", the loop target section data of the part is acquired in step S504. Referring to FIG. 18, since the excitement item for the intermediate part is “0”, the loop target section data is acquired only for the intermediate part. Therefore, assuming that the section data K shown in FIG. 23 is selected as the non-loop target section data, the section data L is a selection candidate as the corresponding loop target section data.

However, there is a case where there is no part whose excitement item is set to “0”. Even in this case, since the extra time must be eliminated, an intermediate part is selected as a default (step S50).
6). This is because the middle part is often relatively long, and it is difficult to feel a sense of incongruity even if it is repeatedly played. By the way, the loop section data is
Since only one part is acquired, there is a case where the time is not exhausted by performing only once. For this reason, in step S5068, the number of loops is determined so that there is no extra time. For example, as shown in FIG. 18, the time of the intermediate part is 30 seconds, and if the tempo is 120, the number of quarter notes becomes “60”. On the other hand, since the non-loop target section data K has a quarter note number of “52”, if the loop target section data is excluded, the quarter note number is “8”.
There is too much time. Since the performance time of the loop target section data L is "4" in quarter notes, "2" loop performances are required to eliminate the extra time. Then, in steps S510 and S512, the time difference is adjusted, and the arrangement data is output in step S512. When the section data K and L are used, there is no time difference, and only the arrangement data is output in step S514.

(13) Embodiment Where Arrangement Processing (v) is Applied Finally, a case where the arrangement processing (v) shown in FIG. 34 is performed as the arrangement processing will be described. This arrangement processing (v)
Then, the music is arranged by efficiently using the loop target section data having a plurality of lengths. In step S550, the game long time is acquired, and in step S552, the non-loop target section data of the first half part, the middle part, and the second half part is acquired. Therefore, the total playing time is calculated in step S554.

In step S546, it is determined whether there is any extra time, and if there is any extra time, loop section data is acquired in step S558. The condition at this time corresponds to the intermediate part, is shorter than the remaining time, and is the longest one narrowed down in such a manner. For example, assuming that the excitement item is “0” in the middle part and the race rank is “9 million yen or less”, in the section database shown in FIG. 23, the identification IDs of “M”, “N”, “O” Those are selection candidates. Assuming that the remaining time is "22" in quarter notes, the section data M that is shorter than the remaining time and the longest is the loop target section data. Therefore, the section data M is acquired, and it is determined whether or not the non-loop target section data acquired in step S560 is the shortest. However, the section data M is not the shortest, and the total playing time after acquisition is obtained in step S562. Is calculated, and the process returns to step S556.

In step S556, it is determined whether there is any extra time. In this case, since the section data having the number of quarter notes "16" has been acquired for the previous extra time "22", the extra time is calculated as follows. It should be 16 = 6. Therefore, the remaining time is "6", and in step S558, the section data O having a shorter playing time is selected. However, since the section data O is the shortest, step S560
Thus, the determination on the time difference in step S564 is performed without proceeding to step S562.

In this embodiment, a plurality of loop target section data having different playing times are prepared.
Since the playing times are multiples of each other, the selection operation becomes relatively simple by gradually acquiring the playing times that are longer as described above. When the time difference is determined in step S564 as described above, the total performance time tends to be longer than the game long time when there is a time difference in the previous arranging process, but there is a time difference in the main arranging process. The longer the game, the longer the game. Therefore, if there is no fade-in priority, the tempo tends to be slow, and if there is fade-in priority, the offset amount and the like are set without cutting the first bar.

Finally, FIG. 37 shows the outline of the present invention as described above. When arranging music such as BGM of a game, a non-loop target section unsuitable for repetitive performance and a loop target section suitable for repetitive performance or arbitrary addition / deletion are configured, and each is stored in the databases 21 and 22. Since the recording function allows reading by the reading functions 23 and 24, when the game progress information 25 is acquired by the game progress information acquiring function 26, the arrangement control function 27 reads the non-loop target section while reading the non-loop target section. In order to output the arrangement data 28 according to the progress of the game, an arbitrary performance time can be realized, and the BGM of the game can be realized.
It is possible to realize an extremely effective arrangement.

[Brief description of the drawings]

FIG. 1 is a schematic block diagram of a game machine that executes a horse racing game to which a music arrangement program according to an embodiment of the present invention is applied.

FIG. 2 is a diagram showing a schematic flowchart of a horse racing game to which a music arrangement program according to an embodiment of the present invention is applied.

FIG. 3 is a diagram showing a schematic flowchart of a race data determination process.

FIG. 4 is a diagram showing a schematic flowchart of a racetrack data setting process.

FIG. 5 is a diagram showing the contents of a weather database at a racetrack.

FIG. 6 is a diagram showing the contents of a race distance database.

FIG. 7 is a diagram showing the contents of a track database.

FIG. 8 is a diagram illustrating a schematic flowchart of a race participation horse determination process.

FIG. 9 is a diagram showing the contents of a race rank database.

FIG. 10 is a diagram showing the contents of a racehorse database.

FIG. 11 is a diagram showing a running speed when the type of a race horse is escape.

FIG. 12 is a diagram showing a traveling speed when a type of a race horse is preceding.

FIG. 13 is a diagram showing a running speed when the type of the race horse is set to “insert”;

FIG. 14 is a diagram showing a running speed when the type of a race horse is run-in.

FIG. 15 is a diagram showing a schematic flowchart of a process for determining a race situation of each horse.

FIG. 16 is a diagram showing a schematic flowchart of a process of determining a race development.

FIG. 17 is a diagram showing a basic race situation.

FIG. 18 is a diagram showing a table for recording a determined game development.

FIG. 19 is a diagram showing a table for recording elements determined to be excited in the first half part.

FIG. 20 is a diagram showing a table for recording elements determined to be excited in the middle part.

FIG. 21 is a diagram showing a table for recording elements which are determined to be excited in the latter part.

FIG. 22 is a diagram illustrating a schematic flowchart of an arrangement process according to the first example;

FIG. 23 is a diagram showing contents of a section database.

FIG. 24 is a diagram of a musical score representing the non-loop target section data A of the first half part.

FIG. 25 is a loop target section data B of the first half part.
FIG.

FIG. 26 is a diagram of a musical score representing non-loop target section data C of an intermediate part.

FIG. 27 is a diagram of a musical score representing non-loop target section data D of an intermediate part.

FIG. 28 is a diagram of a musical score representing the non-loop target section data E of the second half part.

FIG. 29 is a view showing a schematic flowchart of fine adjustment processing.

FIG. 30 is a diagram showing a schematic flowchart of an arrangement process according to a second example.

FIG. 31 is a diagram showing a schematic flowchart of section database reference processing.

FIG. 32 is a view schematically showing a flowchart of an arrangement process according to a third example.

FIG. 33 is a view schematically showing a flowchart of an arrangement process according to a fourth example.

FIG. 34 is a view illustrating a schematic flowchart of an arrangement process according to a fifth example;

FIG. 35 is a view showing a schematic flowchart of a race display performance process.

FIG. 36 is a diagram showing the contents of a table for recording arrangement data and tempo corresponding to a long game time.

FIG. 37 is a diagram schematically showing the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 11 ... Bus 12 ... Main CPU 13 ... Graphic control chip 13a ... I / O 14 ... Sound control chip 14a ... I / O 15 ... Auxiliary storage control chip 15a ... CD-ROM drive 16 ... RAM 17 ... ROM 18 ... Controller I / O 18a ... External controller

Continued on the front page F term (reference) 2C001 AA10 BA07 BB04 BB05 BB07 BB08 BC09 CB01 CB06 CC08 5D378 MM47 MM96

Claims (15)

[Claims] 1. A non-loop target section reading function for reading data of a non-loop target section in the music, wherein the music is arranged in order to play music in accordance with the progress of a game on a computer. A loop target section reading function for reading the data of the loop target section, a game progress information obtaining function for obtaining game progress information, and a non-loop target section for performing the above-mentioned non-loop target section in accordance with the obtained game progress information. A music arrangement program which causes a computer to realize an arrangement control function of arranging the music so that a section is added as appropriate according to the progress of the game. 2. The music arrangement program according to claim 1, wherein the game progress information acquiring function acquires information on a game end timing, and the music arrangement control function acquires a music end timing based on the game end timing. A music arrangement program characterized by arranging music so as to match with. 3. The music arrangement program according to claim 1, wherein the game progress information acquisition function acquires a game long time before the start of the game, and the arrangement control function includes: A music arrangement program which arranges music so that the playing time is adjusted in correspondence with the game long time. 4. The music arrangement program according to claim 3, wherein the arrangement control function refers to a combination of a non-loop target section and a loop target section prepared in advance corresponding to the game long time. Characteristic music arrangement program. 5. The music arrangement program according to claim 1, wherein the loop target section read by the loop target section reading function has a plurality of sections, and each of the sections is a multiple. The musical composition is characterized in that the arrangement control function determines the incorporation of the non-loop target section in order from the section with the longest play time in the loop target section. Arrangement program. 6. The music arrangement program according to any one of claims 1 to 5, wherein the arrangement control function adjusts a performance time by changing a tempo within a predetermined range. program. 7. The music arrangement program according to any one of claims 1 to 6, wherein the arrangement control function adjusts the performance time by starting the game within a predetermined range by starting the game at a different time from the start of the game. A music arrangement program characterized by: 8. The music arrangement program according to claim 1, wherein the arrangement control function fades in at the start of performance. 9. The music arrangement program according to any one of claims 1 to 8, wherein the game progress information acquisition function acquires a game development pattern as the game progress information, and controls the music arrangement control. In the function, a music arrangement program characterized by selecting a section to be looped according to the development pattern. 10. The music arrangement program according to claim 9, wherein the arrangement control function repeats a loop target section in a flat tone portion in the development pattern. 11. The music arrangement program according to claim 9 or 10, wherein the arrangement control function selects a non-loop target section according to the development pattern. program. 12. The music arrangement program according to claim 11, wherein the arrangement control function selects the non-loop target section with reference to a database storing a correspondence between the development pattern and the non-loop target section. A music arrangement program characterized by: 13. A non-looping section reading function for reading a data of a non-looping section in the music, the medium recording a program for arranging music in order to play music in accordance with the progress of a game on a computer. A loop target section reading function for reading data of a loop target section in the music, a game progress information obtaining function for obtaining game progress information, and playing the non-loop target section in accordance with the obtained game progress information. A medium recording a music arrangement program, wherein the computer also has an arrangement control function of arranging the music so that a loop target section is appropriately added and played according to the progress of the game. 14. A music arrangement device for arranging music in order to play music in accordance with the progress of a game, comprising: non-loop target section storage means for storing data of a non-loop target section in the music; Loop target section storage means for storing data of the loop target section in the above, game progress information obtaining means for obtaining game progress information, and performing the non-loop target section in accordance with the obtained game progress information, A music arrangement device comprising: an arrangement control unit that arranges the music so that a target section is appropriately added and played according to the progress of the game. 15. A music arrangement method for arranging music in order to play music in accordance with the progress of a game, wherein a non-loop target section and a loop target section constituting the music are obtained by acquiring progress information of the game. A music arrangement method comprising: performing a non-loop target section on the basis of the above data;