JP2011206445A - Program, information storage medium, route creating device, and arrangement board creating device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a novel puzzle game using letters.SOLUTION: The route of arrangement of letters in a string of letters presented as a question on a letter board 30 used in the letter puzzle game to make a letter string having a meaning by connecting the letters in a way of drawing one continuous line is created first by determining a starting square and after that, adding squares one by one to extend the route from the starting square. At the time, a candidate square for the next route is selected from unfixed squares adjacent to the head square of the fixed route. Then, when the route is temporarily extended to the selected candidate square, whether the route shall be completed or not is determined based on whether a dead-end square is made and whether an unfixed square is connected. When it is determined that completion is possible, the candidate square is fixed as a new route and the route is extended by one square.

Description

  The present invention relates to a program or the like for causing a computer to create a route for assigning characters or the like as a correct answer route for a square array panel arranged in a vertical and horizontal direction.

  As a kind of puzzle game using characters, a crossword puzzle in which a given word is filled in a predetermined blank area is well known. A game is also known in which characters are freely filled one by one in a predetermined blank area so that meaningful words can be formed (see, for example, Patent Document 1).

JP 2002-253840 A

  A puzzle game using characters does not require reflexes like a shooting game or a fighting action game, and is one of the games that can be enjoyed by a wide range of people regardless of gender. However, it is undeniable that the game gets bored, and a new game is always required. An object of the present invention is to realize a puzzle game using characters by a new approach.

The first form for solving the above problem is
Characters such as letters, numbers, symbols, or combinations thereof (hereinafter referred to as “characters”) are assigned letters, etc., and are connected in the vertical and horizontal directions (hereinafter referred to as “mass”). .)) For a game in which the player finds a route that passes only once, the correct answer route is determined with respect to an array board (for example, the dial 30 in FIG. 5) to which the character or the like is not assigned. A program for causing a computer to perform an arithmetic process so as to create an assignment route for the character or the like (for example, a route generation program 312 in FIG. 20),
From the array board, a start point cell selection means (for example, the route generation unit 212 of FIG. 20; steps C9 and C13 of FIG. 24) that selects the start point cell of the route and sets it as a definite cell,
Candidate cell selection means for selecting candidate cells from the undefined cells adjacent to the latest confirmed cell (for example, the route generation unit 212 in FIG. 20; step C19 in FIG. 24),
Availability determination means for determining whether or not a route is completed when a temporary route is extended to the candidate cell (for example, route generator 212 in FIG. 20; step C21 in FIG. 24);
Extending means for extending the temporary route by one cell when the candidate cell is determined to be acceptable by the candidate cell as the latest determined cell (for example, the route generator 212 in FIG. 20; step C25 in FIG. 24),
And the function of the computer as well as the candidate mass selection means, the availability determination means, and the extension means are repeatedly functioned, and the temporary route in the case where all the squares of the array board become a definite mass, the correct answer route It is a program to make it.

As another form,
The character or the like is assigned for use in a game that allows the player to find a route that passes once through the squares that are assigned and connected in the vertical and horizontal directions so that a meaningful sequence of characters or the like is obtained. A route creation device (for example, the portable game device 1000 in FIG. 20) that creates an assignment route of the characters and the like that are the correct answer route with respect to an unordered square array board,
From the array board, selecting a starting point mass of the route, a starting point mass selecting means as a fixed mass,
Candidate mass selection means for selecting candidate masses from uncertain masses adjacent to the latest confirmed mass;
Availability determination means for determining whether or not a route is completed when a temporary route is extended to the candidate mass;
An extension means for extending the temporary route by 1 square with the candidate mass as the latest confirmed mass when it is determined as acceptable by the availability determination means;
And a route creation device in which the candidate route selection unit, the availability determination unit, and the extension unit are repeatedly functioned so that the temporary route when the all squares of the array board are determined squares is the correct route. It is good also as comprising.

  According to the first embodiment, characters and the like for use in a game that allows the player to find the order of passing the cells arranged in the vertical and horizontal directions so as to form a meaningful arrangement of the characters only once. It is possible to create a route for assigning characters and the like that will be the correct route for a square array board to which no is assigned. In addition, the allocation route is generated by selecting the starting point cell as a confirmed cell, selecting a candidate cell from among the unestablished cells adjacent to the latest confirmed cell, and completing the route when the temporary route is extended to this candidate cell. If it is determined whether or not the route is complete and the completion of the route is determined to be possible, the process repeats the process of extending the temporary route by one cell with the candidate cell as the latest determined cell, and all cells on the array board become the fixed cell In addition, it is realized by setting the provisional route as the correct answer route.

As a second form, a program of the first form,
Grouping means for grouping each square of the array board into two groups by alternately selecting squares in a checkered pattern according to the arrangement position (for example, the route generation unit 212 in FIG. 20; step B9 in FIG. 23) ) To function the computer,
If the number of cells belonging to the two groups is different, the selection unit causes the computer to function so as to select a starting point cell from among cells belonging to the larger group (for example, step C13 in FIG. 24). ,
It is also possible to configure a program for this purpose.

  According to this second mode, when the two groups divided by selecting each square of the array board in a checkered pattern according to the arrangement position are different from each other, the larger group The starting point cell is selected from the cells belonging to. Since the cells are grouped by alternately selecting the cells in a checkered pattern, the correct answer route is to select the cells belonging to each of the two groups alternately. For this reason, the start point cell and the end point cell of the correct answer route are cells belonging to the group having the larger number of cells.

As a third form, a program according to the first or second form,
The availability determination means is
A dead path detection means (for example, a forward path generation unit 212 in FIG. 20; step D15 in FIG. 25) for detecting an indeterminate mass that satisfies a predetermined dead path condition by extending a temporary path to the candidate mass;
Using a detection result of the narrow path detecting means, a narrow path determining means (for example, the normal path generating unit 212 in FIG. 20; steps D17 to D25 in FIG. 25) for determining whether or not the normal path is completed;
It is good also as comprising the program for functioning the said computer so that it may have.

  According to the third embodiment, whether or not a route is completed is determined by detecting an undefined cell that satisfies a predetermined bag path condition by extending a provisional route to a candidate cell.

Specifically, as in the fourth form,
Means for determining that the forward path completion is not possible when there are two or more uncertain masses that satisfy the condition of the path including the detection result of the path narrowing detection means (for example, FIG. 20). The route generation unit 212; step D19 of FIG. 25: YES to D23),
Thus, a program for causing the computer to function may be configured.

  According to the fourth embodiment, when there are two or more undetermined masses that satisfy the culled path condition including the undetermined masses that are detected as satisfying the culled path condition, it is determined that the forward path is not completed. . This is because an uncertain cell that satisfies the dead-line condition cannot be obtained as an end point cell.

A fifth form is a program of the third or fourth form,
Grouping means for grouping each square of the array board into two groups by alternately selecting squares in a checkered pattern according to the arrangement position (for example, the route generation unit 212 in FIG. 20; step B9 in FIG. 23) ) To function the computer,
Means for determining whether or not the route is completed depending on whether or not the uncertain cell detected by the bag route detecting means belongs to the same group as the starting point cell (for example, the route generation in FIG. 20) Part 212; step D21) of FIG.
Thus, a program for causing the computer to function may be configured.

  According to the fifth embodiment, whether or not the forward route is completed is determined according to whether or not the undefined cell detected as satisfying the dead-line condition belongs to the same group as the starting point cell. Since the cells are grouped by alternately selecting the cells in a checkered pattern, the correct answer route is to select the cells belonging to each of the two groups alternately. In other words, if two groups belong to the same number of cells, the start and end cells belong to different groups. On the other hand, if two groups belong to a different number, the larger number of cells. The cells belonging to this group become the start point cell and the end point cell. In this way, since the group to which the end point cell belongs is determined by the group to which the start point cell belongs, the route can be completed depending on whether or not the group to which the indeterminate cell condition that satisfies the dead-end condition belongs is the group that should belong to the end point cell. / Impossibility can be determined.

As a sixth form, the program according to any one of the first to fifth forms,
The connectivity determination means (for example, FIG. 20) determines that the route completion is impossible when the undecided mass does not satisfy a predetermined connection condition by extending the provisional route to the candidate mass. A normal path generation unit 212; steps D5 to D11) of FIG.
Thus, a program for causing the computer to function may be configured.

  According to the sixth aspect, when the tentative route is extended to the candidate mass, and all the unconfirmed masses do not satisfy the predetermined connection condition, it is determined that the route cannot be completed.

Specifically, as in the seventh embodiment,
The connectivity determination means includes
Virtual mass placement means (for example, route generator 212 in FIG. 20; steps C1 to C3 in FIG. 24) for placing a virtual mass (for example, the judgment mass 50 in FIG. 13) around the array board;
Virtual mass confirmation means (for example, the route generation unit 212 in FIG. 20; steps D1 to D3 in FIG. 25) that sets all virtual masses as virtual confirmed masses when the latest confirmed mass is adjacent to any of the virtual cells;
Determining that the route completion is impossible when the uncertain mass and the virtual uncertain mass included in the eight cells around the candidate mass do not satisfy the connection condition.
Thus, a program for causing the computer to function may be configured.

  According to the seventh embodiment, when a virtual cell is arranged around the array board and the latest determined cell is adjacent to any one of the virtual cells, all virtual cells are set as virtual determined cells. Then, when the unconfirmed cell and the virtual unconfirmed cell included in the eight cells around the candidate cell do not satisfy the connection condition, it is determined that the route is not completed.

As an eighth form, the program according to any one of the first to seventh forms,
The candidate mass selection means preferentially selects an unconfirmed mass that is not in a straight line direction connecting the latest confirmed mass and the confirmed mass determined immediately before the unconfirmed mass adjacent to the latest confirmed mass. A program for causing the computer to function as a cell may be configured.

  According to the eighth embodiment, of the unconfirmed cells adjacent to the latest confirmed cell, the unconfirmed cell that is not in the straight line direction connecting the latest confirmed cell and the one confirmed immediately before it is preferential. Selected as a candidate cell. As a result, the number of bent portions in the route to be created increases, making it difficult to find meaningful characters and the like, increasing the difficulty of the game.

A ninth form is a program according to any one of the first to seventh forms,
The candidate mass selection means has an unconfirmed mass in a straight direction connecting the latest confirmed mass and the confirmed mass confirmed immediately before the unconfirmed mass adjacent to the latest confirmed mass, and the linear direction The computer is made to function so as to have means (for example, the route generation unit 212 in FIG. 20) that changes which of the unconfirmed cells that are not in the list is preferentially selected as a candidate cell in accordance with a given difficulty level. It is also possible to configure a program for this purpose.

  According to the ninth embodiment, among the unconfirmed cells adjacent to the latest confirmed cell, the unconfirmed cell in the straight line direction connecting the latest confirmed cell and the one confirmed immediately before it is given priority. If it is selected as a candidate cell, the number of bent portions in the route to be created is reduced, and it becomes easier to find a line of meaningful characters and the like, and the difficulty of the game is reduced. On the other hand, if a square that is not in the straight line direction is preferentially selected as a candidate square, it becomes difficult to find a line of meaningful characters and the like because the number of bent portions in the created route increases and the difficulty of the game increases. In this way, it is possible to create a route according to a desired difficulty level.

As a tenth form, the program according to any one of the first to seventh forms,
The candidate mass selection means gives priority to the unconfirmed mass located to the right or below the latest confirmed mass and the unconfirmed mass located to the left or above among the unconfirmed masses adjacent to the latest confirmed mass. It is also possible to configure a program for causing the computer to function so as to have means for changing whether to select a candidate cell according to a given difficulty level.

  According to the tenth embodiment, when an unconfirmed cell located to the right or below the latest confirmed cell is preferentially selected as a candidate cell among unconfirmed cells adjacent to the latest confirmed cell, the route created However, it is a normal route that goes to the right or down. In other words, it becomes easier to find a line of characters or the like in a direction according to Japanese horizontal writing or vertical writing, and the difficulty of the game is reduced. On the other hand, if the unconfirmed cell located on the left or top of the latest confirmed cell is selected as a candidate cell, the rough direction of the route to be created is the opposite of the horizontal or vertical writing in Japanese. It becomes difficult to find out the line of characters and the like, and the difficulty of the game becomes high. In this way, it is possible to create a route according to a desired difficulty level.

As an eleventh form,
For use in a game in which the player finds a route that passes through a cell that has been assigned a character or the like and is connected in the vertical and horizontal directions only once so as to form a meaningful sequence of characters. A program for causing a computer to perform calculation processing to create an array board,
N (N is 2 or more) basic array boards whose allocation route is determined in advance with the start point cell and the end point cell being one of the surrounding cells, the i-th (i = 1 to (N−1)) basis By arranging the end point cell of the array board and the start point cell of the (i + 1) th basic array board adjacent to each other, the order from the start point mass of the first basic array board to the end point mass of the Nth basic array board is in the correct answer order. A program for causing the computer to function as the arrangement configuration means for creating the layout board for the questions may be configured.

As another form,
An array for creating an array board for questions of the squares to be used in a game that allows a player to find a route that passes through the squares connected in the vertical and horizontal directions only once so that a meaningful sequence of characters or the like is obtained. A board creation device,
N (N is 2 or more) basic array boards whose allocation route is determined in advance with the start point cell and the end point cell being one of the surrounding cells, the i-th (i = 1 to (N−1)) basis By arranging the end point cell of the array board and the start point cell of the (i + 1) th basic array board adjacent to each other, the order from the start point mass of the first basic array board to the end point mass of the Nth basic array board is in the correct answer order. It is also possible to constitute an array board creation device that creates the array board for the questions to be asked.

  According to the eleventh form, etc., the squares for use in a game that allows the player to find the order of passing the squares connected in the vertical and horizontal directions so as to form a meaningful sequence of characters etc. only once. You can create a layout board for questions.

As a twelfth form,
In order to use in a game that allows the player to find a route that passes only once through the squares that are allocated in the vertical and horizontal directions so as to form a meaningful sequence of letters, etc. Is a program for causing a computer to calculate the creation of an array board of the cells to which the character or the like is not assigned and the creation of the assignment route of the letters, etc., which is the correct answer route for the array board,
An array board candidate creating means for creating an array board candidate to be a candidate for the array board by arranging the cells;
Whether or not the number of assigned squares of each of the two groups differs by two or more when each square of the array board candidates is grouped into two groups by alternately selecting squares in a checkered pattern according to the arrangement position The sequence board candidate pass / fail judgment means for judging pass / fail of the sequence board candidate in
Re-creation control means for repeatedly re-creating the array board candidate creation means until it is determined to be good by the array board candidate quality determination means,
The correct answer route is created by causing the computer to function as and executing the program of any of the first to tenth forms using the array board candidate determined to be good by the array board candidate pass / fail determination means as the array board It is also possible to configure a program for causing the computer to function.

  According to the twelfth aspect, the square questions for use in a game that allows the player to find out the order of passing the squares connected in the vertical and horizontal directions only once so as to form a meaningful arrangement of characters and the like. An array board for the user can be created, and an assignment path for characters or the like that will be the correct answer path can be created for the array board.

  As a thirteenth mode, a computer-readable information storage medium (for example, the storage unit 300 in FIG. 20) that stores the program of any one of the first to twelfth modes may be configured.

  The “information storage medium” here includes, for example, a magnetic disk, an optical disk, an IC memory, and the like. Then, according to the thirteenth aspect, by causing a computer to read a program stored in an information storage medium and executing the program, the same operational effects as any of the first to twelfth inventions can be exhibited. it can.

An external appearance example of a portable game device. An example of a game screen. An example of a game screen. An example of a game screen. Example of dial configuration. Schematic diagram of route generation for the dial. Explanatory drawing of the parity of a cell. Explanatory drawing of the determination of a starting point mass. Explanatory drawing of Fukurokoji trout. Explanatory drawing of the determination of the normality completion of a normal route based on a dead-end street mass. Explanatory drawing of the determination of the normality completion of a normal route based on a dead-end street mass. Explanatory drawing of the connection / disconnection of an indefinite mass. Explanatory drawing of determination of the possibility of completion of a normal route based on connection / disconnection of an indeterminate mass. Explanatory drawing of determination of the possibility of completion of a normal route based on the connection / disconnection of an indeterminate mass. Explanatory drawing of determination of the possibility of completion of a normal route based on the connection / disconnection of an indeterminate mass. Explanatory drawing of determination of the possibility of completion of a normal route based on the connection / disconnection of an indeterminate mass. Explanatory drawing of determination of the possibility of completion of a normal route based on the connection / disconnection of an indeterminate mass. Explanatory drawing of determination of the possibility of completion of a normal route based on the connection / disconnection of an indeterminate mass. Explanatory drawing of determination of the possibility of completion of a normal route based on the connection / disconnection of an indeterminate mass. The functional block diagram of a portable game device. Data structure example of generated dial data. The flowchart of a game process. The flowchart of the dial face production | generation process performed during a game process. The flowchart of the route generation process performed during a game process. The flowchart of the route completion possibility determination process performed during a route generation process. The figure explaining the difference in the difficulty by the number of the bending parts in a regular route. The figure explaining selection of the candidate cell according to the difficulty. The figure explaining the difference in the difficulty by the direction of a regular route. The figure explaining the production | generation of the dial by the combination of a basic dial. Example of setting the route on the basic dial. Example of setting the route on the basic dial. The figure explaining the production | generation of the dial by the combination of a basic dial.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. In the following, an example in which a character puzzle game is executed in a portable game device will be described, but embodiments to which the present invention can be applied are not limited thereto.

[Appearance of game device]
FIG. 1 is an external view of a portable game apparatus 1000 according to this embodiment. According to FIG. 1, the portable game apparatus 1000 includes a direction input key 1002 and a button switch 1004 for a player to input a game operation, a first liquid crystal display 1006, a second liquid crystal display 1008, a speaker 1010, The image sensor module 1014 and the control unit 1020 are provided in a foldable apparatus main body that can be opened and closed by a hinge. On the display surfaces of the first liquid crystal display 1006 and the second liquid crystal display 1008, touch panels 1012 that can touch and input an arbitrary position on the display screen by touching with a stylus pen 1040 or the like are mounted.

  Further, the apparatus main body is provided with a memory card reader 1016 that can read and write data from and to a memory card 1030 that is a computer-readable information storage medium. The memory card 1030 stores programs and various setting data necessary for the control unit 1020 of the portable game apparatus 1000 to execute various arithmetic processes related to game play. In addition, the apparatus main body is provided with a built-in battery, a power button, a volume control button, etc., not shown.

  The touch panel 1012 covers almost the entire display screen of each of the first liquid crystal display 1006 and the second liquid crystal display 1008 without shielding the display screen. When the player performs a touch operation touched with the stylus pen 1040 or a finger, the upper left The contact position coordinate in the orthogonal Xw, Yw axis coordinate system with the origin as the origin is output to the control unit 1020.

  The control unit 1020 corresponds to a control board of the game device, and includes various microprocessors such as a CPU (Central Processing Unit), a GPU (Graphics Processing Unit), and a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), a VRAM, and the like. Various IC memories such as RAM and ROM are mounted. The control unit 1020 also includes a wireless communication module 1022, a triaxial acceleration sensor 1024, driver circuits for the first liquid crystal display 1006 and the second liquid crystal display 1008, a driver circuit for the touch panel 1012, direction input keys 1002, and button switches 1004. A so-called I / F circuit (interface circuit) such as a signal receiving circuit, an amplifier circuit for outputting an audio signal to the speaker 1010, and a signal input / output circuit to the memory card reader 1016 is mounted. Each element mounted on the control unit 1020 is electrically connected via a bus circuit so that data can be read and written and signals can be transmitted and received.

  The triaxial acceleration sensor 1024 detects acceleration in the three axial directions of the X, Y, and Z axes orthogonal to detect a change in posture or position of the portable game apparatus 1000 and outputs a detection signal to the control unit 1020. To do. In addition, it is good also as a structure provided with a gyro sensor as a function addition instead of an acceleration sensor. Alternatively, a function of a magnetic sensor that detects a change in position or posture with reference to geomagnetism may be added.

  The control unit 1020 reads out programs and data stored in the memory card 1030 by the memory card reader 1016 and temporarily stores them in the IC memory to be mounted. Then, the read program is executed to execute arithmetic processing, and a given game is executed by controlling each part of the portable game apparatus 1000 in accordance with operation inputs from the direction input key 1002, the button switch 1004, and the touch panel 1012. To do.

  In the present embodiment, the portable game apparatus 1000 is configured to read out necessary programs and various setting data from the memory card 1030, but via the wireless communication module 1022, the Internet, LAN (Local Area Network), WAN ( It is also possible to connect to a wired / wireless communication line N such as Wide Area Network and download from an external device.

[Game Overview]
In the present embodiment, a “character puzzle game” is executed in the portable game apparatus 1000. This character puzzle game is a game in which displayed characters are connected to complete a meaningful character string (word, sentence, etc.).

  FIG. 2 is an example of a game screen. In the drawing, the upper side shows the question screen W1 of the first liquid crystal display 1006, and the lower side shows the answer screen W2 displayed on the second liquid crystal display 1008. A plurality of character blocks 10 arranged in the vertical and horizontal directions are displayed on the answer screen W2. The characters displayed in each character block 10 are each character constituting a predetermined question character string that is a meaningful sentence or word, and one character is assigned to one character block 10. In the present embodiment, the characters constituting the question character string are “Hiragana”, but may include katakana, kanji, numbers, arithmetic symbols, and the like. In FIG. 2, nine character blocks 10 to which each character of the question character string “Minami Jujisei” is assigned are displayed in a 3 × 3 array. Further, the answer screen W2 displays a remaining time 21 for which an answer can be made, a determination icon 22 for instructing the completion of the answer, and a redo icon 23 for instructing to redo the answer.

  In the answer screen W2, as shown in FIG. 3, the player inputs an answer by a touch operation using the stylus pen 1040 or the like. That is, each character block 10 is connected so as to become the estimated question character string by a slide operation in which the question character string is estimated from the character sequence and moved while touching the display screen. At this time, the character blocks 10 adjacent in the vertical and horizontal directions are connected to each other, all the character blocks 10 are selected only once, and the first character to the last character of the question character string are connected by one slide operation. Enter the answer in a so-called one-stroke manner.

  Then, on the answer screen W2, the locus (input locus) 24 of the touch position associated with the slide operation is displayed, and the selected character block 10 is highlighted to indicate that it has been selected. The player's answer is canceled when the redo icon 23 is selected, the reverse display of the character block 10 is returned, and the locus 24 is erased.

  When the answer is finished and the player selects the determination icon 22 or when the remaining time 21 becomes zero, an answer matching screen W3 for the answer of the player is displayed as shown in FIG.

  As shown in FIG. 4, on the answer matching screen W3, the character blocks 10 displayed on the answer screen W2 are displayed side by side in the player's answer order. Then, “correct answer / incorrect answer” is determined depending on whether or not the character string (character sequence) according to the player's answer matches the question character string, and an effect or the like according to the determination result is made.

[principle]
Next, the determination of the arrangement order of the characters in the question character string on the question screen W1, which is a feature of the present embodiment, will be described. First, a “clock face” for arranging the character blocks 10 is set. FIG. 5 is a diagram illustrating an example of the dial 30. As shown in FIG. 5, the dial 30 is formed with a plurality of squares 40 on which the character blocks 10 are arranged. Specifically, a number of squares 40 equal to the number of characters in the question character string are formed, and one character block 10 is arranged in one square 40. In addition, a square-shaped square 40 is formed in accordance with the substantially square-shaped character block 10, and these squares 40 are formed so as to be adjacent to each other in the vertical and horizontal directions. In FIG. 5, the square dial 30 is divided into 4 × 4 grids, and 16 squares 40 are formed.

  In the dial plate 30 in which a plurality of squares 40 are formed in this way, as the arrangement order of each character (character block 10) of the question character string, the route (the square 40) proceeds in the vertical and horizontal directions while passing all the squares once. Connection).

  FIG. 6 is a diagram showing an outline of the procedure for generating the “forward route” on the dial 30. As a procedure for generating a normal route, first, as shown in FIG. 6A, a “starting point cell” in which the first character block 10 of the question character string is arranged is determined. In FIG. 6A, the cell 40-f is the start point cell.

  From this starting point cell, the route is extended by one cell in the vertical and horizontal directions. That is, as shown in FIG. 6A, from among the four cells 40 adjacent to the head cell 40 of the current route in the vertical and horizontal directions, from the cells 40 (undefined cells) that are unconfirmed as the route, A cell 40 (candidate cell) to be a candidate for the next route is selected.

  Each time a candidate cell is selected, it is determined whether or not the normal route can be completed when the temporary route is extended to this candidate cell (whether or not the normal route can be completed). If it is determined that it cannot be completed, another candidate cell is reselected. If it is determined that the completion is possible, the candidate cell is determined as a normal route, and the next candidate cell is selected. In this manner, selection of candidate squares, whether or not a route is completed, and confirmation of candidate squares as regular routes are repeated, and when all squares 40 of the dial 30 become confirmed squares, the route is completed.

  FIG. 6B shows a state in which cells 40-f, 40-g, 40-k, and 40-j are sequentially determined as forward routes. In this case, four cells 40-f, Of 40-i, 40-k, and 40-n, one of the unselected cells 40-i and 40-n is the next candidate cell.

  The starting point cell is determined as follows. First, as shown in FIG. 7, “parity” of “1/0” is set in each square 40 of the dial 30. The parity is set so that the adjacent cells 40 have different parity. FIG. 7 shows an example of a dial plate 30 having a total of 16 squares of 4 × 4, and squares 40 with parity “1” and squares “0” are alternately set in a checkered pattern. Yes. Thus, since the adjacent squares 40 are set to have different parities, the forward path alternately passes through the different parity squares 40.

  Therefore, as shown in FIG. 8A, if the number of the squares 40 of each parity in the dial 30 is the same, the start point square is selected from all the squares 40 of the dial 30. In this case, the parity of the start point cell and the end point cell are different. For example, if the cell 40 with the parity “1” is the start point cell, the cell 40 with the parity “0” is always the end cell. However, even if the number of squares 40 of each parity is the same, there is a case where a normal path cannot be generated depending on which square 40 is selected as the starting point square. In such a case, another cell 40 is reselected as the start cell.

  Further, as shown in FIG. 8B, if the difference in the number of the parity cells 40 in the dial 30 is “1”, the parity cell 40 having the larger cell number has the start point cell and the end point. Become a mass. That is, the start point cell is selected from the parity cells 40 having the larger cell number. In FIG. 8B, the number of squares with parity “1” is “8” and the number of squares with parity “0” is “7”. Therefore, the square 40 with parity “1” is the start point and end point. Become a mass.

  Further, as shown in FIG. 8C, when the difference in the number of squares 40 of each parity in the dial 30 is “2” or more, a normal path cannot be generated. In FIG. 8C, the number of cells of parity “1” is “8”, the number of cells of parity “0” is “6”, and therefore the difference in the number of cells of each of the two parities is “2”. Therefore, it is impossible to generate a route.

  There are (A) a dead end mass (dead end) and (B) a non-confirmed mass unconnected as determination factors for whether or not completion is possible in the middle of extending a normal route.

(A) Fukurokoji Mass First, the “bukurokoji mass” is a mass 40 that satisfies the sacrificial path condition, that is, a mass 40 whose forward path can be extended only in one direction among the four directions of up, down, left and right.

  FIG. 9 is an example of a dead end mass. In FIG. 9A, three squares 40-a, 40-b, and 40-f are squares 40 (final squares) that have been confirmed as regular routes, and the square 40-g has been selected as a candidate square. is there. When the temporary route is extended from the cell 40-f to the cell 40-g, the cell 40-e has only a route from the cell 40-i to the cell 40-e, and therefore the cell 40-e becomes a dead-end cell. .

  In FIG. 9B, four cells 40-a, 40-b, 40-f, and 40-g are fixed cells, and the cell 40-k is selected as a candidate cell. When the temporary route is extended from the mass 40-g to the mass 40-k, the masses 40-c and 40-e become the dead-end mass. You can't get much of the Fukurokoji square as the "end square". That is, as shown in FIG. 9 (b), if there are two or more dead-end street masses, the normal route cannot be completed.

  However, there is a case where it is impossible to generate a normal route even if there is only one dead end mass. Specifically, this is a case where the parities between the dead-end square and the end-point square do not match. This is because the dead-end mass cannot be obtained as an end point mass. As described above, the parity of the end point cell is determined by the parity of the start point cell and the number of cells 40 of each parity (that is, the even / odd number of the total number of cells 40 in the dial 30).

  FIG. 10 is an example of a case where there is one dead-end street mass but a normal path cannot be generated. As shown on the left side of FIG. 10, in the dial 30, two squares 40-f and 40-b are fixed squares, and square 40-c is selected as a candidate square, and square 40-b is changed to square 40-c. When the temporary route is extended, the mass 40-a becomes a dead-end street mass. Also, the right side of FIG. 10 is a diagram showing an example of setting the parity of each square 40 of the dial 30. The parity of the start point cell 40-f is “1”, and therefore the parity of the end point cell must be “0”. However, the parity of the square 40-a, which is a dead-end square, is “1” and does not match the parity “0” of the end point square. Therefore, in FIG. 10, it is impossible to complete the route.

  As a simple method of determining whether or not a normal route can be completed by a culvert cell, every time a candidate cell is selected, it is determined whether or not all unconfirmed cells become culvert cells when a temporary route is extended to this candidate cell. There is a way to do it.

  In the present embodiment, the following method is adopted for speeding up the processing operation. In other words, a new short path mass that can be newly created by extending a provisional route to a candidate mass is one of the squares 40 immediately before the candidate mass, that is, one of the four squares 40 on the top, bottom, left, and right of the head cell of the determined regular route.

  For example, in FIG. 9A, when the three cells 40-a, 40-b, and 40-f are determined cells, there is no blocked path cell. This is because at this time, the cell 40-g and the cell 40-e may be the next route after the cell 40-f. When the temporary route is extended to the candidate cell 40-g, the cell 40-e can no longer be selected as the next route after the cell 40-f, and the cell 40-e becomes the dead-end cell.

  Subsequently, as shown in FIG. 9B, when the cell 40-k is a candidate cell, the cell 40-c is not a dead-end cell. Then, when the temporary route is extended to the candidate cell 40-k, the cell 40-c becomes the dead-end cell. For this reason, it is only necessary to determine whether or not only the four squares 40 on the top, bottom, left, and right of the first square (latest final square) of the confirmed route are to become a dead-line square.

  FIG. 11 is a diagram illustrating an example of the determination of the block path mass. In FIG. 11A, three cells 40-a, 40-b, and 40-f are fixed cells, and a cell 40-g is a candidate cell. In this case, the four squares 40-b, 40-e, 40-g, and 40-j on the top, bottom, left, and right sides of the square 40-f that is the head square of the determined regular path are the target for determining the short path square. As a result, the mass 40-e is determined to be a dead-end street mass. At this time, the cumulative total of the alleys is “1”.

  Next, as shown in FIG. 11B, it is assumed that the candidate cell 40-g is determined as a normal route, and the cell 40-k is set as the next candidate cell. In this case, the four squares 40-c, 40-f, 40-h, and 40-k on the top, bottom, left, and right of the square 40-g that is the leading square of the normal path are the target for determining the short path square. As a result, the mass 40-c is newly determined as a blocked path mass. In other words, a total of “2” squares 40-c and 40-e, together with the square 40-e that has already been determined as the dead-line square, become the dead-line square. At this point, it is determined that the route is not complete.

(B) Unconfirmed mass unconnected “Undetermined mass is not connected” means that the connection condition is not satisfied, that is, a set of uncertain cells adjacent to each other is defined as one “block”. That is, there is a block.

  FIG. 12 is a diagram illustrating an example in which an undetermined cell is not connected. In FIG. 12, the three cells 40-e to 40-g are in a definite cell state. Here, when the cell 40-h is a candidate cell, twelve uncertain cells 40-a to 40-d and 40-i to 40-p are divided into blocks of four cells 40-a to 40-d. , Eight blocks 40-i to 40-p are separated, and the undefined block is “unconnected”. In this way, when the undetermined mass is not connected, the route cannot be completed.

  As a simple method for determining whether “unconfirmed mass is connected / disconnected”, first, an arbitrary uncertain mass is selected, and another undefined mass adjacent thereto is selected. In this way, adjacent unconfirmed cells are selected one after another, and when there are no unconfirmed cells that can be selected, if there are no unconfirmed cells that have not been selected, it is determined as “connected” and selected. There is a method of determining “unconnected” if there is no uncertain cell.

  In the present embodiment, the following method is adopted for speeding up the processing operation. That is, as shown in FIG. 13, a connected / unconnected “determination virtual cell (determination cell) 50” is additionally set on the outer periphery of the dial 30. As shown in FIG. 13, when the start point cell is adjacent to the determination cell 50, the set determination cell 50 is handled as a cell (confirmed cell) determined as a normal route. Next, as shown in FIGS. 14 and 15, eight squares around the candidate square are extracted, and the connection / non-connection of the undetermined square is determined for these eight squares. This determination result becomes a determination result of connection / disconnection of all undefined cells.

  In FIG. 13, 20 determination cells 50-a to 50-t are set around the dial 30. Further, the cell 40-e of the dial plate 30 is a starting point cell, and this cell 40-e is adjacent to the determination cell 50-i. For this reason, all the determination cells 50-a to 50-t are handled as fixed cells.

  Then, as shown in FIG. 14, when two cells 40-e and 40-f are determined cells and the cell 40-g is a candidate cell, eight cells 40 around the cell 40-g that is a candidate cell. -B to 40-d, 40-f, 40-h, and 40-j to 40-l are extracted. Of these eight cells 40, seven uncertain cells 40-b to 40-d, 40-h, 40-j to 40-l are “connected”. Therefore, in the dial 30, it is determined that all unconfirmed cells are “connected”.

  Next, as illustrated in FIG. 15, when the three cells 40-e, 40-f, and 40-g are determined cells and the cell 40-h is a candidate cell, the area around the cell 40-h that is a candidate cell is displayed. Eight cells 40-c, 40-d, 40-g, 40-k, 40-1 and determination cells 50-h, 50-j, 50-l are extracted. Of these eight squares, the four undetermined squares 40-c, 40-d, 40-k, and 40-1 are “unconnected”. Accordingly, in the dial 30, all unconfirmed cells are determined as “unconnected”.

  As shown in FIG. 16, when the starting point cell is not adjacent to the determination cell 50, the determination cell 50 is handled as a cell that is not fixed as a normal route (undefined cell). Similarly, eight squares around the candidate square are extracted, and the connection / non-connection of the undecided square is determined for these eight squares. In this case, all the determination cells 50 are changed from the unconfirmed cells to the fixed cells when the cells 40 adjacent to the determination cells 50 are determined as the normal route in the course of determining the normal route. In FIG. 16, the start point cell is a cell 40-f, and this cell 40-f is not adjacent to the determination cell 50. Accordingly, all the determination cells 50-a to 50-t are treated as undetermined cells.

  Then, as shown in FIG. 17, when the squares 40-f and 40-g are determined as normal routes and the square 40-h is a candidate square, eight squares 40 around the square 40-h that is a candidate square. -C, 40-d, 40-g, 40-k, 40-l and determination cells 50-h, 50-j, 50-l are extracted. Of these eight cells, seven undefined cells 40-c, 40-d, 40-k, 40-1 and determination cells 50-h, 50-j, 50-1 are used. Connection / non-connection is determined. In this case, since it is determined that they are “connected”, it is determined that all unconfirmed cells on the dial 30 are “connected”.

  Then, as shown in FIG. 18, when the squares 40-f, 40-g, and 40-h are determined as normal routes and the candidate square is the square 40-1, the square 40-h is adjacent to the determination square 50-j. Therefore, all the determination cells 50-a to 50-t are changed from the unconfirmed cells to the confirmed cells. Then, eight cells 40-g, 40-h, 40-k, 40-o, 40-p around the cell 40-l that is a candidate cell, and determination cells 50-j, 50-l, 50 -N is extracted, and connection / disconnection is determined for cells 40-k, 40-o, and 40-1 that are three undefined cells among these eight cells. In this case, since it is determined that they are connected, it is determined that all unconfirmed cells on the dial 30 are connected.

  Further, as shown in FIG. 19A, when a “hole” having no square 40 is formed on the dial 30, a determination square 50 is set in this “hole”. This determination cell 50 is initially set as an undetermined cell. Then, as shown in FIG. 19B, when the cell 40 adjacent to the “hole” becomes a confirmed cell, the determination cell 50 set in this “hole” is changed from the unestablished cell to the confirmed cell. Changed to

  In FIG. 19A, a “hole” is formed in a portion corresponding to the cell 40-k in the dial plate 30, and a determination cell 50-u is set in this “hole”. In FIG. 19B, the cells 40-f and 40-g are determined cells. That is, the cell 40-g adjacent to the determination cell 50-u is a fixed cell, and at this point, the determination cell 50-u is a fixed cell.

[Function configuration]
FIG. 20 is a block diagram illustrating a functional configuration of the portable game apparatus 1000. According to FIG. 20, the portable game apparatus 1000 functionally includes an operation input unit 110, an imaging unit 120, a processing unit 200, an image display unit 130, an audio output unit 140, and a communication unit 150. And a storage unit 300.

  The operation input unit 110 receives an operation input by the player and outputs an operation signal corresponding to the operation to the processing unit 200. The function input unit 110 is realized by a button switch, a joystick, a touch pad, a trackball, an acceleration sensor unit, an inclination sensor unit, or the like. In FIG. 1, the direction input key 1002, the button switch 1004, and the touch panel 1012 correspond to this.

  The imaging unit 120 receives light from the imaging target, converts it into an electrical signal, generates digital image data, and outputs the digital image data to the processing unit 200. This function is available in lenses, mechanical shutters, shutter drivers, photoelectric conversion elements such as CCD image sensor modules and CMOS image sensor modules, digital signal processors (DSPs) that read charge amounts from photoelectric conversion elements and generate image data, IC memories, etc. Realized. In FIG. 1, the image sensor module 1014 corresponds to this.

  The processing unit 200 is realized by, for example, a microprocessor such as a CPU or GPU, an electronic component such as an ASIC (Application Specific Integrated Circuit), an IC memory, and the like, and includes the operation input unit 110 and the storage unit 300. Input / output data to / from each functional unit. Then, various arithmetic processes are executed based on a predetermined program and data and an operation input signal from the operation input unit 110 to control the operation of the portable game apparatus 1000. In FIG. 1, the control unit 1020 corresponds to this. The processing unit 200 includes a game calculation unit 210 that mainly performs calculation processing related to game execution, an image generation unit 230 that generates a game image based on data obtained by the processing of the game calculation unit 210, and sound effects. And a sound generation unit 240 for generating game sounds such as BGM.

  The game calculation unit 210 includes a route generation unit 212 and performs game processing according to the game program 310. Specifically, in the game process, the game calculation unit 210 first determines a question character string. That is, one question character string is selected from among the question character string groups prepared in advance stored as the question character string group data 320 according to the question difficulty level or the like.

  Next, dial generation processing is performed to set a dial 30 corresponding to the determined number of characters in the question character string. That is, a predetermined contour extraction process is performed on the captured image by the imaging unit 120, and the shape of the dial 30 based on the extracted contour is determined. Then, on the dial plate 30 whose shape has been determined, at least the squares 40 whose size is appropriately determined so that the squares 40 corresponding to the number of characters in the question character string are arranged are arranged so as to be continuous in the vertical and horizontal directions.

  Here, data about the generated dial 30 is stored as generated dial data 340.

  FIG. 21 is a diagram showing an example of the data structure of the generated dial face data 340. As shown in FIG. According to FIG. 21, the generated dial data 340 includes dial shape data 341 defining the shape of the dial 30 and arrangement mass data 350 for the square 40 set on the dial 30.

  The arrangement cell data 350 stores a cell number 351, a start cell 352, a start cell parity 353, an end cell 354, and an end cell parity 355 set in the dial 30. In addition, for each square 40, a square ID 356a, an adjacent square 356b in the vertical and horizontal directions, a parity 356c, a selection state 356d as a normal path, and a dead path flag 356e indicating whether or not it is a dead path square are associated with each other. In addition, for each determination cell 50, a determination cell ID 357a, an adjacent cell 357b in the vertical and horizontal directions, and a selection state 357c are stored in association with each other.

  Subsequently, the game calculation unit 210 generates an answer screen W2 in which the character block 10 to which each character of the question character string is assigned is arranged on the generated dial 30 according to the route generated by the route generation unit 212, and is displayed as an image. Display on the unit 130. Next, the correct / incorrect answer is determined by comparing whether or not the sequence of characters answered by the player on the answer screen W2 matches the question character string. Then, an effect according to the determination result, for example, an effect process of displaying a captured image that is the basis of the dial 30 when the answer is correct is performed.

  The route generation unit 212 performs route generation processing to generate a route in which the character block 10 to which each character of the question character string is assigned in the generated dial 30 is arranged. Specifically, first, a starting point cell is determined. In other words, “1/0” parity is set in each square of the dial 30 so that the parity of adjacent squares 40 is different, and the number of squares of each parity is counted. If the number of squares in each parity is the same, for example, one randomly selected square from all squares 40 is set as the starting point square. The parity different from the parity of the start point cell is set as the parity of the end point cell. On the other hand, if the number of squares of each parity is different, for example, one randomly selected square 40 out of the parity squares 40 having the larger number of squares is set as the starting point square. Then, the parity of the start point cell is set as the parity of the end point cell.

  Then, the starting point cell is set as the first fixed cell, and the route is extended from the starting point cell by one cell. In other words, one of the four squares 40 on the upper, lower, left, and right sides adjacent to the confirmed square is randomly selected from the unestablished squares, and is set as a candidate square for the next route. Then, a route completion determination process is performed to determine whether or not the route can be completed (possible / impossible) when the temporary route is extended to this candidate cell.

  In the route completion availability determination process, (A) Fukurokoji mass, (B) Unconfirmed mass connection / disconnection, and whether or not the route completion based on each is determined, and when both are determined to be possible, the route can be completed Is determined.

  Specifically, for the determination based on the culvert path square, each of the upper, lower, left and right squares 40 adjacent to the head square (the latest confirmed square) of the confirmed route is newly extended by extending the temporary route to the candidate square. It is determined whether or not it becomes a dead-end street mass. If it does not become a new dead-end street mass, it is determined that the completion of the normal route is “possible”. In addition, if the new path becomes a new path and the total number of the path path including the new path becomes “1”, it is determined whether or not the parity of the new path is equal to the parity of the end point. If so, it is determined that the completion of the route is “impossible”. In addition, if a new path alley mass is newly obtained and the total number of path alley masses including the new path alley mass is “2” or more, it is determined that completion of the normal path is “impossible”.

  For determination based on connection / non-connection of undefined cells, a connection / non-connection determination cell 50 is additionally set around the dial 30. These determination cells 50 are initially set as undetermined cells, and when any of the cells 40 adjacent to the determination cell 50 becomes a fixed cell (when determined as a normal route), the determination cell 50 is determined from the undetermined cell. Change to

  Then, eight squares around the candidate square (the square 40 and the judgment square 50) are extracted, and the connection / non-connection of the uncertain squares among the extracted eight squares is determined. If it is determined that the links are connected, it is determined that all the uncertain cells on the dial 30 are connected, and the completion of the route is determined as “possible”. On the other hand, if it is determined that they are not connected, it is determined that all unconfirmed cells on the dial 30 are not connected, and the completion of the route is determined as “impossible”.

  As a result of the normal route completion determination process, if it is determined that the normal route is “possible”, the candidate cell is set as a confirmed cell, the route is extended to this candidate cell, and the next candidate cell is selected. On the other hand, if it is determined that the completion of the route is “impossible”, it is determined that the current candidate cell is inappropriate as a route, and is separated from other undefined cells adjacent to the head cell 40 of the route. The candidate cell is selected and the same determination is performed. In the meantime, if there is no unconfirmed cell that can be selected as a candidate cell in the cell 40 adjacent to the first cell 40 in the confirmed route, the selection of the current start cell is canceled and another start cell is reset. . This is repeated until all the squares 40 are determined squares, thereby generating a normal route. Data about the generated route is stored as generated route data 360.

  Returning to FIG. 20, the image generation unit 230 is realized by, for example, a processor such as a graphics processing unit (GPU) or a digital signal processor (DSP), an IC memory for a drawing frame such as a video signal IC, a video codec, or a frame buffer. The The image generation unit 230 generates one game image in one frame time (for example, 1/60 second) based on the processing result by the game calculation unit 210 and outputs the generated image signal of the game image to the image display unit 130. To do.

  The image display unit 130 displays various game images based on the image signal input from the image generation unit 230. For example, it can be realized by an image display device such as a flat panel display or a cathode ray tube (CRT). In FIG. 1, the first liquid crystal display 1006 and the second liquid crystal display 1008 correspond to this.

  The sound generation unit 240 is realized by a processor such as a digital signal processor (DSP) or a voice synthesis IC, or an audio codec that can reproduce a sound file, for example. Based on the processing result of the game calculation unit 210, sound effects and BGM related to the game are realized. Then, sound signals of various operation sounds are generated and output to the sound output unit 140.

  The sound output unit 140 is realized by a device that outputs sound effects, BGM, and the like based on the sound signal input from the sound generation unit 240. In FIG. 1, the speaker 1010 corresponds to this.

  The communication unit 150 is connected to the communication line N to realize communication. For example, a wireless communication device, a modem, a TA (terminal adapter), a wired communication cable jack, a control circuit, and the like are realized, and the wireless communication module 1022 in FIG. 1 corresponds to this.

  The storage unit 300 stores a system program for realizing various functions for causing the processing unit 200 to control the portable game apparatus 1000 in an integrated manner, a game program necessary for executing the game, various data, and the like. . Further, it is used as a work area of the processing unit 200, and temporarily stores calculation results executed by the processing unit 200 according to various programs, input data input from the operation input unit 110, and the like. This function is realized by, for example, an IC memory such as a RAM and a ROM, a magnetic disk such as a hard disk, and an optical disk such as a CD-ROM and DVD. In FIG. 1, the IC memory and the memory card 1030 mounted on the control unit 1020 correspond to this. In the present embodiment, the storage unit 300 stores the game program 310 as a program, and the question character string group data 320, the captured image data 330, the generated dial data 340, and the generated route data 360 as data. Is memorized.

[Process flow]
FIG. 22 is a flowchart for explaining the flow of the game process. According to FIG. 22, the game calculation unit 210 first determines the question character string (step A1). Next, a dial setting process is performed to generate a dial 30 that matches the number of characters in the determined question character string (step A3).

  FIG. 23 is a flowchart for explaining the flow of the dial setting process. According to FIG. 23, the game calculation unit 210 first performs a shooting process (step B1). Then, contour extraction is performed on the captured image (step B3), and the shape of the dial 30 is determined based on the extracted contour (step B5). Next, the cell 40 having the number of characters in the question character string is set on the dial plate 30 having the determined shape so as to be connected in the vertical and horizontal directions (step B7).

  Subsequently, the parity of “1/0” is set in the set square 40 so that the parity of adjacent squares 40 is different (step B9). Next, the number of squares in each parity is counted, and if the difference in the number of squares in each parity is equal to or greater than “2” (step B11: NO), it is determined that the generation of the forward path is “impossible” in the dial 30 (step B13) After changing the arrangement of the squares 40 on the dial 30 (step B15), the process returns to step B9 and the same processing is repeated.

  On the other hand, if the difference in the number of squares of each parity is equal to or less than “1” (step B11: YES), it is determined that generation of a normal route is possible in the dial 30 (step B17). When the above processing is performed, the dial setting processing is terminated.

  Thereafter, the route generation unit 212 performs route generation processing to determine the arrangement order of the characters in the question character string on the dial 30 (step A5).

  FIG. 24 is a flowchart for explaining the flow of the route generation process. According to FIG. 24, first, a connection determination square 50 is additionally set around the dial 30 (step C1), and these determination squares 50 are initially set as undetermined squares (step C3).

  Next, the start point cell determination process is performed to determine the start point cell. That is, the number of squares of each parity on the dial 30 is counted, and if the number of squares of each parity is the same (step C7: YES), for example, one square 40 is randomly selected from all the squares 40 of the dial 30. Is selected as a starting point cell (step C9). Then, a parity different from the determined parity of the start point cell is set as the parity of the end point cell (step C11).

  On the other hand, if the number of squares of the two parities is different (step C7: NO), for example, one square 40 is randomly selected from the squares 40 having the larger number of squares as the starting point square. (Step C13). Then, the parity that is the same as the parity of the determined start point cell is set as the end point cell parity (step C15).

  After the start point cell is determined, the presence / absence of the next advance cell 40 is determined with respect to the latest determined cell that is the leading cell of the route, and if there is no next advance cell 40 (step C17: NO), step Return to C3. If there is a next cell 40 to be advanced (step C17: YES), one of the four cells 40 on the top, bottom, left, and right adjacent to the latest confirmed cell is selected from the unconfirmed cells, and the next candidate cell is selected. (Step C19).

  Subsequently, a normal path completion determination process is performed to determine whether the normal path can be completed or not when the temporary normal path is extended to this candidate cell (step C21).

  FIG. 25 is a flowchart for explaining the flow of the normal path completion determination process. According to FIG. 25, first, a determination is made based on the connection / disconnection of undefined cells. That is, it is determined whether or not the head cell of the route determined at the present time is adjacent to the determination cell 50. If it is adjacent (step D1: YES), the determination cell 50 is set as the determination cell (step D3).

  Next, eight cells 40 around the candidate cell are extracted (step D5), and the connection / disconnection of the undefined cell is determined for the extracted eight cells 40 (step D7). If it is determined that the connection is not connected (step D9: NO), it is determined that all unconfirmed cells on the dial 30 are not connected, and therefore the completion of the route is “impossible” (step D11). On the other hand, if it determines with connecting (step D9: YES), all the undecided squares in the dial 30 are connected, and the determination based on a cover alley square is performed.

  That is, four squares 40 adjacent to the top and bottom, right and left of the head cell of the confirmed route are extracted (step D13), and the provisional route is extended to the candidate cell for each of the uncertain cells among the extracted four cells 40. In step D15, it is determined whether or not a new block path mass is obtained.

  If any of the unconfirmed squares becomes a new dead-blade square (step D17: YES), the cumulative total of the dead-blade squares up to this point including the new dead-blade square is counted. Then, if the total of the short path mass is “2” or more (step D19: YES), it is determined that the completion of the normal path is “impossible” (step D23).

  On the other hand, if the cumulative total of the short path squares is “1” (step D19: NO), it is determined whether or not the parity of the new round path square matches the parity of the end point square. If the parity matches (step D21: YES), the completion of the route is determined as “possible” (step D25), and if not (step D21: NO), the completion of the route is determined as “impossible”. (Step D23).

  On the other hand, if none of the unconfirmed squares becomes a dead-line square (step D17: NO), it is determined that the completion of the normal route is “possible” (step D25). When the above processing is performed, the normal route completion determination processing ends.

  If it is determined that the route can be completed as a result of the route completion determination process (step C23: YES), the temporary route is extended by one cell to the candidate cell, and the candidate cell is set as the confirmed cell (step C25). Next, it is determined whether or not the route is completed. If it is not completed (step C27: NO), the process returns to step C17 and the same processing is repeated. On the other hand, if the route is completed (step C27: YES), the route generation process ends.

  When the route generation process ends, the game calculation unit 210 generates and displays the answer screen W2 by arranging the characters of the question character string in the arrangement order determined on the dial 30 (step A7). Then, the correct answer / incorrect answer is determined based on whether the sentence (character sequence) answered by the player matches the question character string or not, and the answer is matched (step A9). Thereafter, it is determined whether or not to end the question, and if it does not end (step A11: NO), the process returns to step A1, and the same processing is repeated for the next question. On the other hand, if the question is finished (step A13: YES), the game process is finished.

[Action / Effect]
As described above, according to the present embodiment, it is possible to generate an arrangement path of each character of the question character string on the dial 30 used in a character puzzle game in which characters are connected in a manner of one-stroke writing to make a meaningful sentence. Can do. The route in the dial 30 is generated by first determining a start point cell and extending the route one by one from the start point cell. At this time, the candidate cell of the next route is selected from the unconfirmed cells adjacent to the head cell of the confirmed route. Then, when the candidate route is extended to the candidate route, it is determined whether the route is completed based on whether or not a dead-end route is formed and whether or not an undefined block is connected. When it is determined, the route is extended by one cell by determining the candidate cell as a new route.

[Modification]
The application of the present invention is not limited to the above-described embodiment, and it is needless to say that the application can be appropriately changed without departing from the spirit of the present invention.

(A) Level of difficulty For example, the route may be generated in consideration of the level of difficulty of the questions.

(A-1) Number of bent portions Specifically, the number of bent portions in the normal route is set to a number according to the degree of difficulty. A meaningful character string is more difficult to find as the number of bent portions increases, that is, the degree of difficulty tends to be higher. For example, FIG. 26 shows an example in which the same character string of 36 characters “It seems like you've been working hard” is arranged in a different arrangement order. In FIG. 26 (a), the number of bent portions is small and bent at 10 points. On the other hand, in the same figure (b), there are many bending parts and it bends in 27 places. When these are compared, it can be said that the smaller the number of bent portions, the easier it is to find a meaningful character string.

  For this reason, as shown in FIG. 27, when selecting a candidate cell, if the degree of difficulty is to be increased (it is desired to be difficult), an unconfirmed cell adjacent to the first cell (the latest confirmed cell) of the confirmed route is displayed. Among them, the undecided mass that is not in the straight line connecting the leading square of the confirmed route and the previous square is preferentially selected to increase the number of bent parts, and conversely, the difficulty level should be lowered (easily If it is desired to reduce the bent portion, the uncertain mass in the linear direction is preferentially selected.

  In the figure, squares 40-i to 40-k are final squares, and the next squares 40-g, 40l, and 40-o adjacent to the leading square 40-k of the confirmed route are the following. A case where a candidate cell is selected is shown. In this case, the linear direction connecting the latest confirmed cell 40-k and the immediately preceding confirmed cell 40-j is the “left-right direction (lateral direction)”. Then, when it is desired to lower the difficulty level, the cell 40-1 arranged in the direction along the linear direction is preferentially selected. On the contrary, when the difficulty level is desired to be increased, the square direction is selected. The squares 40-g and 40-o that are not arranged in the along direction are preferentially selected.

(A-2) The direction of the route In Japanese sentences, the character strings arranged from left to right or from top to bottom tend to be easier to read. For example, FIG. 28 is an example in which the same nine-character string “Niju Issei” is arranged in a different arrangement order. In FIG. 5A, the upper left character is the first character, and the characters are arranged in a normal direction from here to the right. On the other hand, in FIG. 5B, the lower right character is the first character, and the characters are arranged in a forward direction from here. Comparing these, it can be said that it is easier to find a meaningful character string when characters are arranged from left to right or from top to bottom.

  For this reason, the number of times of proceeding upward in the generated route is counted, and if it is a certain number or more, it is determined that the route has a high degree of difficulty. When the generated route does not reach the desired difficulty level, the route with the necessary difficulty level can be obtained by regenerating the route until the number of times of upward movement reaches the specified number of times or more.

(B) Combination of basic dials As another method of generating a regular route, a plurality of basic dials (basic arrangement boards) having a smaller number of cells than the desired dial 30 are prepared and combined to form one character. The board 30 may be generated.

  Specifically, for example, as shown in FIG. 29, a plurality of basic dials 60 obtained by dividing a desired dial 30 are generated. In these basic dials 60, for example, as shown in FIGS. 30 and 31, a plurality of routes are defined. When the basic dial 60 is combined with another basic dial 60, the normal route is such that the start point cell and the end point cell are adjacent to the start point cell and the end point cell of the other adjacent basic dial 60. Determined. Then, for example, as shown in FIG. 32, a dial 30 having a desired number of squares is generated by combining these basic dials 60. At this time, the basic dial 60 may be combined by rotating or reversing.

  In FIG. 29, the dial 30 is divided into four regions 32A to 32D. The regions 32A and 32D have the same shape, and the regions 32B and 32C have the same shape. Then, for the basic dial 60A having the same shape as the areas 32A and 32D, as shown in FIG. 30, basic dials 60A-1 and 60A-2 in which two types of routes are set are generated. For the basic dial 60B having the same shape as the regions 32B and 32C, as shown in FIG. 31, basic dials 60B-1 and 60B-2 having two types of routes are generated.

  The normal path in the basic dial 60 is set so as to pass through all the squares once and connect two start / end squares 62 serving as start or end squares. This start / end point cell is a cell in the periphery of the basic dial 60, and is set to a cell adjacent to the start / end point cell 62 of the other basic dial 60 when combined with another basic dial 60. Is done.

  And the desired dial 30 is produced | generated by combining the basic dials 60A and 60B. For example, in FIG. 32, the basic dial 60A-1 is arranged in the area 32A, the basic dial 60B-1 is rotated by 180 degrees in the area 32B, and the basic dial 60B-1 is arranged in the area 32C. This is an example in which the route of the dial 30 is generated by arranging the basic dial 60A-1 by rotating it 180 degrees in the region 32D.

  In this way, by combining the basic dial 60 in which the route is set, the route on the desired dial 30 is generated. Since this route is a closed route, one of two adjacent cells along the closed route can be a single route by setting one as a start point and the other as an end point.

  Further, when the closed route generated by combining the basic dial 60 is not left-right symmetric or vertically symmetric, a different route can be generated by generating the route after the closed route is horizontally reversed or vertically reversed. Similarly, when the closed route is not rotationally symmetric, the route may be generated after the closed route is rotated.

  Furthermore, instead of combining a plurality of basic dials 60 to generate a closed route, several closed routes are prepared in advance, and one of these is selected to generate a route. good. As a result, the route can be generated at a higher speed. In this case as well, a different route can be generated by reversing or rotating the closed route.

(C) Print output on paper Further, as an output method of the route of the generated problem sentence (arrangement order of each character), the answer screen W2 may be printed on paper instead of being displayed on a display or the like.

(D) Character type In the above-described embodiment, each character constituting the question character string is “Hiragana”, but other character types such as katakana, kanji, numbers, arithmetic symbols, etc. may be used. it can. Of course, it can be a question character string using a plurality of character types. For example, there are mathematical formulas such as multiplication table and “12 × 12 = 144” as question character strings using numbers and operation symbols.

  Furthermore, it is applicable also to Braille. In this case, for example, a general six-point Braille includes characters represented by “two characters” such as muddy sounds, semi-voiced sounds, stuttering, and numbers. By selecting, it can be similarly applied.

(E) Game to be applied Further, the route generation method in the present embodiment is applicable not only to the character puzzle game but also to other games. For example, the present invention can be applied to creation of a route in an action game for moving a player character on a predetermined route, automatic generation of a dungeon, and the like.

(F) Game device to be applied In addition, in the above-described embodiment, the case where the game device is applied to a portable game device has been described. However, the present invention can also be applied to an arcade game device and a home game device. Furthermore, not only game devices but also electronic devices such as mobile phones, compact digital cameras, music players, personal computers, and car navigation systems that can execute application software have built-in computers that can execute programs, or the computers themselves. Therefore, it can be set as one form which implement | achieves this invention.

DESCRIPTION OF SYMBOLS 1000 Portable game device 110 Operation input part, 120 Image pick-up part 130 Image display part, 140 Sound output part, 150 Communication part 200 Processing part 210 Game operation part, 212 Path generation part 230 Image generation part, 240 Sound generation part 300 Storage part 310 game program, 312 route generation program 320 question character string group data, 330 captured image data 340 generation dial data, 360 generation route data 10 character block 30 dial, 40 square, 50 judgment square

Claims (15)

A route that passes only once through the squares that are arranged in the vertical and horizontal directions to which letters, numbers, symbols, or combinations thereof (hereinafter referred to as “characters”) are meaningfully arranged. A program for causing a computer to perform calculation processing to create an assignment route for the character, etc., which becomes a correct answer route for a square array board to which the character, etc. is not assigned, for use in a game to be found by a player There,
From the array board, selecting a starting point mass of the forward route, a starting point mass selecting means as a definite cell,
Candidate mass selection means for selecting candidate masses from among unestablished masses adjacent to the latest confirmed mass,
Availability determination means for determining whether or not a route is completed when a temporary route is extended to the candidate mass;
An extension means for extending the temporary route by one square with the candidate mass as the latest confirmed mass when it is determined as acceptable by the availability determination means;
And the function of the computer as well as the candidate mass selection means, the availability determination means, and the extension means are repeatedly functioned, and the temporary route in the case where all the squares of the array board become a definite mass, the correct answer route Program to make it. The computer functions as a grouping means for grouping into two groups by selecting the cells alternately in a checkered pattern according to the arrangement positions of the cells on the array board,
The selection means causes the computer to function so as to select a start point cell from among cells belonging to the larger group when the number of cells belonging to the two groups is different;
A program according to claim 1 for. The availability determination means is
A dead end detection means for detecting an indeterminate square that will satisfy a predetermined dead end condition by extending a provisional route to the candidate mass;
Using the detection result of the bag path detection means, the path to determine whether or not the route is completed,
The program according to claim 1 or 2 for causing the computer to function so as to have the following. The bag path determination means has means for determining that the forward path completion is impossible when there are two or more uncertain masses that satisfy the bag path condition including the detection result of the bag path detection means.
The program according to claim 3 for causing the computer to function as described above. The computer functions as a grouping means for grouping into two groups by selecting the cells alternately in a checkered pattern according to the arrangement positions of the cells on the array board,
The dead path determination means has means for determining whether or not the forward path is completed depending on whether or not the uncertain mass detected by the dead path detection means belongs to the same group as the start point mass,
The program according to claim 3 or 4 for causing the computer to function as described above. The availability determination means includes a connectivity determination means for determining that the route completion is impossible when all uncertain masses do not satisfy a predetermined connection condition by extending a provisional route to the candidate mass.
The program according to any one of claims 1 to 5 for causing the computer to function as described above. The connectivity determination means includes
Virtual mass arrangement means for arranging a virtual mass around the array board;
Virtual mass confirmation means for setting all virtual masses as virtual confirmed masses when the latest confirmed mass is adjacent to any of the virtual masses;
Determining that the route completion is impossible when the uncertain mass and the virtual uncertain mass included in the eight cells around the candidate mass do not satisfy the connection condition.
The program according to claim 6 for causing the computer to function as described above.   The candidate mass selection means preferentially selects an unconfirmed mass that is not in a straight line direction connecting the latest confirmed mass and the confirmed mass determined immediately before the unconfirmed mass adjacent to the latest confirmed mass. The program as described in any one of Claims 1-7 for functioning the said computer so that it may select as a cell.   The candidate mass selection means has an unconfirmed mass in a straight direction connecting the latest confirmed mass and the confirmed mass confirmed immediately before the unconfirmed mass adjacent to the latest confirmed mass, and the linear direction The computer according to any one of claims 1 to 7, for causing the computer to function so as to have a means for varying which of the unconfirmed cells not present in the list is preferentially selected as a candidate cell according to a given difficulty level. The program described in the section.   The candidate mass selection means gives priority to the unconfirmed mass located to the right or below the latest confirmed mass and the unconfirmed mass located to the left or above among the unconfirmed masses adjacent to the latest confirmed mass. The program according to any one of claims 1 to 7, for causing the computer to function so as to have means for changing whether to select a candidate cell according to a given difficulty level. For use in a game in which the player finds a route that passes through a cell that has been assigned a character or the like and is connected in the vertical and horizontal directions only once so as to form a meaningful sequence of characters. A program for causing a computer to perform calculation processing to create an array board,
N (N is 2 or more) basic array boards whose allocation route is determined in advance with the start point cell and the end point cell being one of the surrounding cells, the i-th (i = 1 to (N−1)) basis By arranging the end point cell of the array board and the start point cell of the (i + 1) th basic array board adjacent to each other, the order from the start point mass of the first basic array board to the end point mass of the Nth basic array board is in the correct answer order. A program for causing the computer to function as an arrangement configuration means for creating the layout board for the questions. In order to use in a game that allows the player to find a route that passes only once through the squares that are allocated in the vertical and horizontal directions so as to form a meaningful sequence of letters, etc. Is a program for causing a computer to calculate the creation of an array board of the cells to which the character or the like is not assigned and the creation of the assignment route of the letters, etc., which is the correct answer route for the array board,
An array board candidate creating means for creating an array board candidate to be a candidate for the array board by arranging the cells;
Whether or not the number of assigned squares of each of the two groups differs by two or more when each square of the array board candidates is grouped into two groups by alternately selecting squares in a checkered pattern according to the arrangement position The sequence board candidate pass / fail judgment means for judging pass / fail of the sequence board candidate in
Re-creation control means for repeatedly re-creating the array board candidate creation means until it is determined to be good by the array board candidate quality determination means,
The correct answer route by causing the computer to function as the array board candidate determined as good by the array board candidate pass / fail determining means and executing the program according to claim 1 as an array board. A program for causing the computer to function so as to create a program.   The computer-readable information storage medium which memorize | stored the program as described in any one of Claims 1-12. The character or the like is assigned for use in a game that allows the player to find a route that passes once through the squares that are assigned and connected in the vertical and horizontal directions so that a meaningful sequence of characters or the like is obtained. A route creation device for creating an assignment route for the letters, etc., which will be a correct answer route, for an array board of cells that are not provided,
From the array board, selecting a starting point mass of the route, a starting point mass selecting means as a fixed mass,
Candidate mass selection means for selecting candidate masses from uncertain masses adjacent to the latest confirmed mass;
Availability determination means for determining whether or not a route is completed when a temporary route is extended to the candidate mass;
An extension means for extending the temporary route by 1 square with the candidate mass as the latest confirmed mass when it is determined as acceptable by the availability determination means;
And a route creation device in which the candidate route selection unit, the availability determination unit, and the extension unit are repeatedly functioned so that the temporary route when the all squares of the array board are determined squares is the correct route. . For use in a game in which the player finds a route that passes through a cell that has been assigned a character or the like and is connected in the vertical and horizontal directions only once so as to form a meaningful sequence of characters. An array board creation device for creating an array board,
N (N is 2 or more) basic array boards whose allocation route is determined in advance with the start point cell and the end point cell being one of the surrounding cells, the i-th (i = 1 to (N−1)) basis By arranging the end point cell of the array board and the start point cell of the (i + 1) th basic array board adjacent to each other, the order from the start point mass of the first basic array board to the end point mass of the Nth basic array board is in the correct answer order. An arrangement board creation device for creating the arrangement board for the questions.

Images