JP2005165898A - System for providing maze on web and maze construction program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a maze provision system which controls transition between WEB pages without having a management table, etc. <P>SOLUTION: A system for providing a maze on the WEB is provided with: a storage means for preliminarily storing a correct access origin URL and a correct access destination URL; an access origin URL acquisition means for acquiring the URL of a WEB page at an access origin; an access origin determination means for determining whether the acquired access origin URL is the correct access origin URL; a WEB page generation means for generating a WEB page including the correct access destination URL only when the access origin URL is determined to be the correct access origin; and a WEB page transmitting means for transmitting the generated WEB page to a terminal. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a maze providing system and a maze building program using a WEB page on the WEB.

  Conventionally, the following processing has been performed in a scene where transition between a plurality of WEB pages on the WEB is controlled. (1) An existing WEB page that is a transition destination is extracted from an existing WEB page that is a transition source, and (2) a page transition that indicates a transition-source WEB page that is permitted to transition to the WEB page that is the transition destination. A rule is created, and (3) the current page name of a session for which a transition to the transition destination WEB page is requested is managed for each session and set in the page management table. (4) When the current page name matches the transition source page in the page transition rule, the transition to the transition destination page is permitted (see Patent Document 1).

  However, the following problems occur in the conventional example.

  In the above conventional example, the WEB page, the page transition rule (2), and the page management table (3) may be placed and operated on a single server. However, for example, the WEB page is distributed to a plurality of WEB servers. However, the control of transitions across WEB servers, such as transitions from a WEB page of one WEB server to a WEB page of another WEB server, does not work well for the following reasons.

  First, in the conventional example, unless the page transition rule (2) is created and referenced, the transition of the WEB page cannot be controlled. When page transition rules are created independently on each WEB server, the information on the page transition rules held by each WEB server cannot be linked, and it is only necessary to transition between WEB pages in one WEB server. However, if the WEB server is straddled, the transition of the WEB page cannot be controlled. Therefore, there is also a method in which page transition rules for all WEB pages that are subject to transition control are created in a batch, the page transition rules are distributed to a plurality of WEB servers, and the same page transition rules are provided on all WEB servers. Although it is conceivable, it is not so rational, and it is difficult to maintain the consistency of information between WEB servers.

Next, in the page management table of (3), user management is performed based on the session ID for the WEB server. Therefore, if the page management table is distributed, the session IDs between the WEB servers cannot be linked, and transition between WEB pages with different WEB servers cannot be controlled. Therefore, when the page management table is centrally managed by a single management server or the like, the WEB server must access the management server and register information such as a session ID each time after receiving access from the user. Even if the WEB page is distributed, an operation such as useless communication occurs.
Japanese Patent Laid-Open No. 11-167484

  The present invention provides a maze providing system on the WEB that can control the transition between WEB pages without having a management table or the like, and to configure the maze providing system. The main problem is to provide a maze building system on the web that can be created relatively easily in consideration of the link relationship between web pages.

  In order to achieve the above object, the invention according to claim 1 is characterized in that a storage means storing a correct access source URL and a correct access destination URL in advance, and the access source URL when the current URL is accessed from an access source WEB page. Access source URL acquisition means for acquiring the URL of the WEB page, access source determination means for determining whether or not the acquired access source URL is a correct access source URL stored in the storage means, and a result of this determination If it is the correct access source, a WEB page including the correct access destination URL is generated as the WEB page corresponding to the current URL. If the result is not the correct access source, the correct access destination URL is generated as the WEB page corresponding to the current URL. WEB page generation means for generating a WEB page that does not include the page, and the generated And the WEB page and a WEB page sending means to be transmitted to the terminal you access to the current URL, adopts a configuration that.

  Further, the invention according to claim 2 is the maze providing system according to claim 1, wherein the predetermined reward condition is stored in the storage means in advance, and when the current URL is accessed, from the access source terminal to the terminal Includes a reward requirement acquisition means for acquiring a reward requirement obtained during WEB surfing, and a reward condition determination means for determining whether the acquired reward requirement satisfies a predetermined reward condition, and the WEB page generation means includes a reward condition Different web pages are generated depending on whether or not is satisfied.

  According to a third aspect of the present invention, a template program and a maze definition of a WEB page generation program are stored in advance, storage means for storing the WEB page generation program in association with a program identifier, and a WEB page generation program The template program corresponds to the identifier of the correct access source URL described in the WEB page generation program when the current URL is accessed from the access source WEB page. If the access source is the correct access source as a result of the determination, a WEB page including the identifier of the correct access destination URL is generated as the WEB page corresponding to the current URL. Is the correct access destination UR as the WEB page corresponding to the current URL A basic function processing unit that causes a computer to execute a process of generating a WEB page that does not include the identifier, and a URL identifier description area that describes URL identifier set information including the identifier of the access source URL and the identifier of the access destination URL, The maze definition causes the creation means to execute the following process in the maze building system on the WEB provided with the URL identifier set information associated with the program identifier. First, a process of reading URL identifier set information associated with a specific program identifier from the maze definition and a process of describing the read URL identifier set information in the URL identifier description area of the template program are executed. Further, the template program describing the URL identifier set information is used as a WEB page generation program, the WEB page generation program is associated with the program identifier, and the process of storing in the storage means is executed.

  By using the URL of the HTML page of the transition source, it is possible to control the transition between the HTML pages of the user. Furthermore, in order to control between the HTML pages, there is no need to prepare a database or the like for storing information of the transition source HTML page. Therefore, a virtual maze can be freely constructed and operated using a plurality of WEB servers without being tied to a single WEB server.

  Hereinafter, an embodiment of the present invention will be described with reference to the drawings.

  FIG. 1 is a conceptual diagram of a virtual maze constructed by an HTML (Hyper Text Markup Language) page (WEB page) on the WEB realized by the present invention. Based on FIG. 1, the concept about a virtual maze will be described.

  The virtual maze is composed of one or a plurality of stages. There are a plurality of HTML pages in the stage, and the HTML pages are linked in a spider web by links (such as hypertext links).

  There are two types of links, correct route and wrong route, which are set in advance by the creator of the virtual maze. Here, the correct answer route is a route that finally reaches the goal by changing the links in a preset order, and there is only one correct answer route. On the other hand, the wrong route means all routes other than the correct route and has a mechanism that does not reach the goal even if the wrong route continues to be changed. A dotted line arrow in FIG. 1 represents a correct route, and a solid line arrow represents an incorrect route. Specifically, the route that follows the HTML page in the order of “start” — “correct answer A” — “correct answer B” — “correct answer C” — “signpost” — “goal” is the correct route, and all other than the above routes Is the wrong route.

  In FIG. 1, “correct answer A” and “mistake A”, “correct answer B” and “wrong B”, “correct answer C” and “wrong C”, “signpost” and “wrong E”, and “goal” and “wrong F”. "Is a set. The two HTML pages in the set represent different HTML pages with the same URL (Uniform Resource Locator). The HTML page displayed to the virtual maze user (hereinafter referred to as the user) varies depending on various conditions described later. Hereinafter, “correct answer A” and “mistake A” are block A, “correct answer B” and “wrong B” are block B, “correct answer C” and “wrong C” are block C, “signpost” and “wrong E” are Block E, “goal” and “error F” are block F.

  Here, the HTML page includes types such as a start page, an incorrect route upper page, a correct route upper page, a signpost page, and a goal page. Hereinafter, characteristics and properties of each HTML page will be described.

  The start page is an HTML page that a user of the virtual maze visits first. The start page includes links to one or more other HTML pages that are transition destinations in the same stage. The “other HTML page” for the start page is an HTML page on the wrong route (page on the wrong route) and an HTML page on the correct route (the page on the correct route). In FIG. 1, “Start” represents the start page.

  The wrong route upper page is an HTML page existing on the wrong route. The wrong route upper page includes links to one or more other HTML pages that are transition destinations in the same stage. The “other HTML page” for the wrong route upper page is a start page and another wrong route upper page. However, in “another wrong route upper page”, there is another wrong route upper page that cannot be linked due to the mechanism of constructing the virtual maze described later. Specific details will be described later. In FIG. 1, “Error A”, “Error B”, “Error C”, “Error D”, “Error E”, and “Error F” represent pages on the error route. In principle, the goal page is not reached via the page on the wrong route. However, once you return to the start page, you may reach the goal page.

  The correct route upper page is an HTML page existing on the correct route. The correct route upper page includes links to one or a plurality of other HTML pages that are transition destinations in the same stage. The “other HTML page” for the correct route upper page is a start page, a correct route upper page (in the following order), an incorrect route upper page, a signpost page described later, and a goal page described later. However, in “another HTML page”, there is a page on the wrong route that cannot be linked because of the mechanism of the virtual maze construction described later. Specific details will be described later. In FIG. 1, “correct answer A”, “correct answer B”, and “correct answer C” represent pages on the correct answer route.

  The signpost page exists on the correct route and at the end point of each stage (however, the end point of the final stage is the goal page), and is an HTML page including a link to the next stage (the HTML page). The link to the next stage is a link to the next block. In FIG. 1, the stage 1 signpost page suddenly changes to the stage 2 goal page, but actually there are a plurality of correct route upper pages and wrong route upper pages before the goal page. In FIG. 1, “signpost” represents a signpost page. If the correct route (the page on the correct route) is not changed in order, the signpost page cannot be reached, and the next stage cannot be reached unless the signpost page is reached. Further, there is an erroneous route upper page that cannot be linked due to the mechanism of the virtual maze construction described later, as in the above incorrect route upper page and correct route upper page. Specific details will be described later.

  The goal page is an HTML page that exists at the end point of the final stage. This is an HTML page that finally reaches the user who has shifted the correct route in the set order, and is an HTML page that is the goal of the game (virtual maze). In FIG. 1, “goal” represents a goal page.

  The above is the description of each HTML page. Next, the block will be described based on the description of each HTML page.

  In this embodiment, the start page is an HTML page that always exists alone (no other HTML page with the same URL is different). In addition, the wrong route upper page exists as a single unit, but there may be the same URL and another type of HTML page (correct route upper page, signpost page, or goal page). The correct route upper page, the signpost page, and the goal page always have an incorrect route upper page with the same URL.

  In FIG. 1, block A, block B, block C, block E, and block F indicate that there are different HTML pages with the same URL. In block A, block B, and block C, the correct route upper page and the incorrect route upper page are HTML pages having the same URL. The block is called a correct block. In block E, the signpost page and the wrong route upper page are HTML pages having the same URL. The block is called a signpost block. In block F, the goal page and the incorrect route upper page are HTML pages having the same URL. The block is called a goal block. Hereinafter, how to handle the blocks will be described.

  Normally, when accessing an HTML page of a block, since there are two HTML pages having the same URL in the block, it should be impossible to determine which HTML page is to be displayed. However, this system has a mechanism for switching and displaying two HTML pages having the same URL depending on certain conditions. There are conditions for the user to reach the correct route upper page, signpost page or goal page. The first condition is that the link on the correct route must be changed in order and the block must be accessed. The second condition is not an access for inputting the URL of the block in the URL input field of the Internet browser, but a transition between HTML pages must be made using a link embedded on the HTML page. If the above two conditions are not satisfied, the wrong route upper page is displayed.

  Here, the transition between the blocks is supplemented. As described above, there is another page on the wrong route that cannot be linked from a page on the wrong route. In addition, there is a page on the wrong route that cannot be linked from the page on the correct route and the signpost page.

  Based on FIG. 2, a page on the wrong route that cannot be linked will be described. In FIG. 2, there are three correct answer blocks. A block X whose URL is X, a block Y whose URL is Y, and a block Z whose URL is Z. The block X includes a correct route upper page X and an incorrect route upper page X. The block Y includes a correct route upper page Y and a wrong route upper page Y. Further, the block Z includes a correct route upper page Z and an incorrect route upper page Z. As a premise of FIG. 2, the transition from the block X to the block Y is a transition on the correct route, and the transition from the block Y to the block Z is a transition on the wrong route. If a link is created in accordance with the explanation of the correct route upper page and the incorrect route upper page described above, the link is as shown in FIG. In conclusion, a double-lined arrow indicates a route that can be in the virtual maze, and a normal arrow indicates a route that cannot be in the virtual maze. In the following description, the transition from the block Y to the block X and the transition from the block Z to the block Y are not considered.

  First, the transition from block X to block Y will be described. There are three possible routes. (1) A route from the correct route upper page X to the correct route upper page Y. (2) A route from correct route upper page X to wrong route upper page Y. (3) A route from the wrong route upper page X to the wrong route upper page Y.

  In the route of (1), the transition from the block X to the block Y is a transition of the correct route based on the above premise, and therefore there must be a route from the correct route upper page X to the correct route upper page Y. The transition by the route of (1) is a transition from an HTML page with a URL of X to an HTML page with a URL of Y. Next, attention is focused on the routes (2) and (3). Similarly to (1), the routes (2) and (3) are also transitions from an HTML page with a URL of X to an HTML page with a URL of Y. That is, the route (1) overlaps with the routes (2) and (3). Although details will be described later, in the virtual maze, which of the two HTML pages having the same URL in the block is to be displayed is determined depending on the URL of the HTML page of the transition source. In the above example, the block Y is set to always display the page Y on the correct route whenever there is an access from any HTML page whose URL is X. Therefore, in the scene where the incorrect route upper page Y should be displayed as in the routes (2) and (3), only the transition from the correct route upper page X to the correct route upper page Y must be permitted. However, there is a problem that the page Y on the correct route is displayed. Therefore, in the scene of FIG. 2, there should be no transition from the correct route upper page X to the incorrect route upper page Y. This is because, regardless of the type of HTML page, when a transition is made from an HTML page with a URL of X to a block Y with a URL of Y, the page always transitions to the page Y on the correct route. As will be described in detail later, the routes such as (2) and (3) have a mechanism that is not created when the HTML page is generated.

  Further, in the above description, the transition from one correct block to the correct block on the next correct route has been described, but the same applies to the following cases. The same applies to a transition from a correct block to a signpost block on the next correct route, a transition from a signpost block to a correct block on the next correct route, and a transition from a correct block to a goal block on the next correct route. . Therefore, in the transition from the block on a certain correct route to the block on the correct route in the next order, the transition from the correct route top page to the correct route top page, from the correct route top page to the signpost page, from the correct route top page Routes other than the correct route upper page cannot be created from the goal page or signpost page. As a specific example of the transition from the block X to the block Y, there is a case such as a transition from the block A to the block B in the stage 1 in FIG.

  On the other hand, the transition from the block Y to the block Z will be described. There are three possible routes. (4) Transition from the correct route upper page Y to the correct route upper page Z. (5) Transition from page Y on correct route to page Z on wrong route. (6) Transition from the wrong route upper page Y to the wrong route upper page Z. Since the above three routes are transitions on the wrong route based on the above assumptions, the wrong route upper page may be displayed anyway. However, since the route (4) is a route on an incorrect route based on the above assumption, it should not transit to the correct route upper page Z. Therefore, this route is impossible in this virtual maze. As for the routes (5) and (6), both are transitions to the wrong route upper page Z. Therefore, there is no problem in the mechanism of the virtual maze, and the route can exist in the virtual maze. In the above description, the transition from the correct block to the correct block not on the next correct route has been described, but the same applies to the following cases. In the case of a transition from a correct block to a signpost block that is not on the next correct route, a transition from a signpost block to a correct block that is not on the next correct route, or a transition from a correct block to a goal block that is not on the next correct route It is the same. As a specific example of the transition from the block Y to the block Z, there is a case such as a transition from the block B to the block E in the stage 1 in FIG.

  The actual transition between HTML pages will be described below based on the stage 1 in FIG.

  When the transition source HTML page is “correct answer A” and the transition destination for the “correct answer A” is the correct block, the transition source HTML page is “wrong D”, and the “wrong D” Compared with the case of block B, where the transition destination is the correct block in the same manner. A transition from “correct A” to block B is a transition in the order on the correct route, whereas a transition from “wrong D” to block B is a transition on the wrong route. In the above two examples, the transition is to the HTML page of the same URL. However, if the correct route upper page “correct answer B” is displayed in spite of following the wrong route, the maze is not interesting. Therefore, in this maze, when an incorrect route is traced and a certain block is accessed, the page on the incorrect route is displayed among two different HTML pages having the same URL. On the other hand, if it can be determined that the correct route is being followed in the set order, the correct route upper page, signpost page, or goal page is displayed among two different HTML pages of the same URL. Therefore, if the transition source HTML page is “error D” and the transition destination for the “error D” is block B, the page on the error route is displayed. On the other hand, when the transition source HTML page is “correct answer A” and the transition destination for the “correct answer A” is block B, the correct answer route upper page is displayed. In order to realize the above mechanism, the transitioned (accessed) block must be able to acquire and determine information such as the URL of the HTML page of the transition source, which will be described later. .

  Next, a case where the URL of a certain block is directly input in the URL input field of the user's Internet browser will be described. In the scene of FIG. 1, when the URL of the block E, which is a signpost block, is directly input, the HTML page to be displayed is not a signpost page, but an incorrect route upper page having the same URL as the signpost page is displayed. In order to display the signpost page, the user must access the block E after following the correct route from “start” — “correct answer A” — “correct answer B” — “correct answer C”. As an example, the signpost page has been described, but for example, consider the case of a block F which is a goal block. For example, it is assumed that a person named X has cleared the virtual maze and learned the URL of the goal page. After that, Mr. X taught his friend, Mr. Y, the URL of the goal page. It is conceivable that Mr. Y enters the URL from the URL input field of the Internet browser and suddenly finishes the goal. Therefore, in this maze, control is applied so that only transitions by links embedded in HTML pages are allowed.

  In this maze, the goal (page) can be reached by continuing the transition of the only correct route. The roles of two different HTML pages with the same URL are to prevent reaching the correct route upper page, the signpost page, and the goal page even though the wrong route is traced. In addition, the URL of the goal page or the like is known by some method, and the URL is input in the URL input field of the Internet browser, so that the user who suddenly reaches the goal is controlled. When the user is following a wrong route, or when accessing the correct block, signpost block, and goal block from the URL input field of the Internet browser, the control displays a page on the wrong route of the same URL, This is a control to prevent the correct route upper page, signpost page and goal page from being shown. The control mechanism will be described later. The above is the description of the concept of the virtual maze constructed by the HTML page on the WEB realized by the present invention.

  Hereinafter, a device configuration for realizing a virtual maze in the present embodiment will be described.

  FIG. 3 is a device configuration diagram for realizing a virtual maze on the WEB. Based on FIG. 3, a device configuration and the like in the virtual maze (game) operation will be described.

  First, in order to realize the virtual maze, the virtual maze is provided with one or more maze display servers 3 as operation side devices and one or more user personal computers 1 (terminals) as virtual maze use side devices. In addition, communication with the Internet network 300 is possible. The user personal computer 1 is a personal computer used by a user of a virtual maze, and can participate in a virtual maze on the WEB by using software for browsing the Internet (Internet browser). Then, when there is an access (HTML page display request) from the user personal computer 1 (Internet browser), the maze display server 3 generates an HTML page corresponding to the request and sends it to the user personal computer 1. A server computer having a function of returning the generated HTML page. In the present embodiment, a virtual maze is realized by using the above devices, the Internet network 300, and the like.

  Next, a detailed configuration of the maze display server 3 will be described with reference to FIG. The maze display server 3 includes a CPU (Central Processing Unit) 5, a memory 7 and a large-capacity storage 9 as storage means, and each element is connected to a bus 13. Further, the network interface 11 is connected to the bus 13. Each element transmits information, commands, and the like between the elements via the bus 13. Then, it is connected to the Internet network 300 via the network interface 11.

  The large-capacity storage 9 includes an HTML request acceptance / return application 17, an HTML generation program group 27 including an HTML generation program 29 (WEB page generation program), and a setting file 25.

  The HTML request acceptance reply application 17 is a process of accepting an HTML page display request (hereinafter referred to as an HTML display request) for an HTML page of a specific URL from the user personal computer 1. Then, HTML is generated by using the URL (current URL) of the HTML page that is the transition destination for the HTML page (transition source HTML page) displayed on the Internet browser of the user personal computer 1 included in the HTML display request. This is a process of searching for an HTML generation program 29 to be started from the program group 27 and starting it. In addition, the HTML page generated by the HTML generation program 29 is returned to the user personal computer 1 (on the Internet browser).

  Next, the HTML generation program 29 and the setting file 25 will be described. The HTML generation program 29 is a program for generating an HTML page. In the above description of the virtual maze, the user has been described as accessing an HTML page. However, it is actually an access to the HTML generation program 29, and the user views the HTML page generated by the HTML generation program 29. Here, in the HTML generation program 29 that generates the correct route upper page, the signpost page, and the goal page on the correct route, the URL of the correct HTML page of the transition source is described. “URL of the correct HTML page of the transition source” is the URL of the HTML page existing immediately before the correct route on the correct route on the specific correct route, the signpost page, and the goal page. That's it. In the present invention, the type of HTML page to be generated is compared by comparing the “URL of the correct transition source HTML page” with the URL of the transition source HTML page included in the HTML display request from the user personal computer 1. To change. In the present embodiment, there is one HTML generation program 29 for generating one HTML page. In the conceptual description of the virtual maze based on FIG. 1 above, there are two different HTML pages with the same URL in the case of the correct block, guidepost block, and goal block. In the case of the block, one of the two HTML pages having the same URL is generated by one HTML generation program 29 in accordance with the above-described conditions. The setting file 25 associates a URL with an HTML generation program 29 for generating an HTML page of the URL. In this system, the WEB server does not have a static HTML page, and even if the user intends to see a static HTML page, the HTML generation program 29 looks at the HTML page dynamically generated each time. It is. In order to display the HTML page of the URL, an HTML generation program 29 for generating the HTML page of the URL must be started. At this time, by referring to the setting file 25, the HTML generation program 29 to be started can be grasped from the URL. Here, it is described above that “the WEB server does not have a static HTML page”, but a static HTML page that has nothing to do with the correct route is arranged on the WEB server, and the user of the virtual maze May be confused.

  The HTML generation program 29 includes four processing units, that is, a rule confirmation unit 31, an original URL acquisition unit 33, a display HTML determination unit 35, and an HTML generation unit 37. The above four processing units provided in the HTML generation program 29 will be described below.

  The rule confirmation unit 31 confirms whether or not a rule is set in the HTML generation program 29 that has received an HTML display request from the user personal computer 1 and, if a rule is set, performs processing for the rule. It is a processing part to perform. For example, a rule is a “timer rule” that sets a time period during which access to a certain HTML page is permitted, a “user input confirmation rule that displays a simple quiz as the content of a certain HTML page, and accepts the answer. ”, A reward requirement such as Cookie is embedded in the user personal computer 1 that has accessed a specific HTML page while surfing the web, and the reward requirement is a rule ( “Cookie rule” or the like that changes the content of the HTML page to be generated depending on whether the reward condition is satisfied or whether the specific HTML page is accessed and the reward requirement is received.

  The source URL acquisition unit 33 is a process of acquiring the URL (access source URL) of the HTML page that is the transition source for the accessed HTML page from the HTML display request from the user personal computer 1. A method of acquiring the URL of the transition source HTML page will be described later.

  The display HTML determination unit 35 generates HTML pages of correct blocks (see block A, block B, and block C in FIG. 1), signpost blocks (see block E in FIG. 1), and goal blocks (see block F in FIG. 1). This is a processing unit existing in the HTML generation program 29. It is a processing unit for determining whether or not the user is changing the correct route in a specific order. A method for the determination will be described later.

  The HTML generation unit 37 is a processing unit that actually generates an HTML page based on the determination result of the display HTML determination unit 35.

  Next, as described in the description of the display HTML determination unit 35, the URL of the HTML page of the transition source is used to determine whether the transition is “in the order of the correct route” or “the transition by the wrong route”. A method will be described. In the case of a block (see FIG. 1), which of the two HTML pages having the same URL is displayed (generated) depends on whether or not the above two conditions are satisfied. It is whether or not the correct route is transited in order and whether or not the access is from the URL input column of the Internet browser. In this system, the URL of the transition source HTML page is used when determining the condition. The HTML generation program 29 other than the HTML generation program 29 for generating a start page and a page on the wrong route existing alone has a start page on the previous correct route as the URL of the correct transition source HTML page. One URL on the correct route upper page (correct answer block) or signpost page (signpost block) is described. Since there is only one correct answer route, the URL of the transition source HTML page acquired from the HTML display request is compared with the URL of the correct transition source HTML page set in the HTML generation program 29, and they match. In this case, “transition according to correct route order” can be confirmed. Therefore, the correct route upper page, signpost page or goal page is displayed instead of the wrong route upper page. On the other hand, if they do not match, it can be determined that the transition is due to an incorrect route, so the page on the incorrect route is displayed. Furthermore, each HTML generation program 29 describes a plurality of URLs of HTML pages that are transition destinations for the HTML page generated by the HTML generation program 29. The URL of the HTML page of the transition destination is “the URL of the correct HTML page of the transition destination” that transitions to the correct route upper page, the signpost page, and the goal page, and “the wrong transition destination HTML page of the transition page URL ”. Here, a supplementary explanation will be given for “the URL of the start page on the previous correct route, the page on the correct route (correct block) or the signpost page (signpost block)”. For example, when the transition source HTML page is the start page, there is no HTML page with the same URL in the start page, so if the URL of the transition source HTML page is viewed from the transitioned HTML page, You can see that it is a transition from the start page. However, if the transition source HTML page is a correct route upper page and a signpost page, an incorrect route upper page with the same URL always exists. Therefore, only the URL of the transition source HTML page is seen, and the transition from the correct route upper page or the signpost page cannot be grasped. However, as described in the above description of transition between blocks (in the explanation based on FIG. 2), in the case of transition from one block to a block on the next correct route, other than the following four patterns of routes Routes are excluded. (1) The route from the correct answer route upper page of a block to the correct block route upper page of the next block, (2) The route from the correct answer route upper page of a block to the signpost page of the next block, (3) The route from the correct answer upper page to the goal page of the next block. (4) The route from the guide page of a certain block to the correct answer route upper page of the next block. Also, in the case of a transition from one block to another block that is not on the next correct route, any access to another block from two different HTML pages with the same URL in a block is due to the transition of the wrong route. Is. Therefore, it is not necessary to determine whether or not the transition source HTML page is a page on the wrong route, and it is determined whether or not the transition is based on the correct route based only on the URL of the transition source HTML page. If there is, it is enough to display the page on the wrong route. Therefore, only by comparing the URL of the correct transition source HTML page described in the HTML generation program 29 with the URL of the transition source HTML page acquired from the HTML display request regardless of the type of the transition source HTML page. It is possible to determine whether or not the correct answer route has been followed. As will be described later, in the case of access from the URL input field of the Internet browser, the URL of the transition source HTML page included in the HTML display request is “blank”. Accordingly, the page of the incorrect transition route described in the HTML generation program 29 does not match the URL of the correct transition source HTML page. In this system, whether or not the transition is from the correct route is determined by the method described above.

  Next, a method for acquiring the URL of the transition source HTML page from the HTML display request will be described as described in the description of the original URL acquisition unit 33. In this system, in order to acquire the URL of the transition source HTML page, the following known technique is used.

  When acquiring the URL of the transition source HTML page, a request header field (referer) described in a document called RFC (Request For Comment) 2616 is used. When an HTML browser display request is made to a WEB server or the like using an Internet browser, the URL of the transition source HTML page is also included in the display request. The area in which the URL of the transition source HTML page is stored is referred to as a request header field, and this system uses the URL in the request header field. Further, when the user manually inputs a URL in the URL input field of the Internet browser, the request header field is blank. Some Internet browsers can be set not to send the URL of the transition source HTML page to the WEB server. However, in order to use this virtual maze, it is a condition that the setting is not performed.

  Here, an outline of a process flow until the CPU 5 of the maze display server 3 receives an HTML display request from the user personal computer 1 and starts the HTML generation program 29 will be described. As a premise for explanation, it is assumed that the URL is “url_a” and the HTML generation program 29 for generating the HTML page of the URL is “program_a” in the setting file 25. In the setting file 25, it is assumed that the URL is “url_b” and the HTML generation program 29 for generating the HTML page of the URL is “program_b”.

  First, the process starts when the CPU 5 of the maze display server 3 accepts an HTML display request generated by clicking a link embedded in an HTML page on the Internet browser of the user personal computer 1. Next, the CPU 5 extracts the URL (current URL) of the HTML page that is the transition destination for the transition-source HTML page from the HTML display request, and stores it in the memory 7. Thereafter, the CPU 5 acquires the URL from the memory 7. Subsequently, the CPU 5 refers to the setting file 25, searches for a URL that matches the URL acquired from the memory 7, and grasps the HTML generation program 29 to be started in order to generate the HTML page of this URL. Then, the CPU 5 activates the grasped HTML generation program 29. For example, if the URL acquired from the HTML display request is “url_a”, the premise of the setting file 25 (the URL is “url_a” in the setting file 25, and the HTML generation program 29 for generating the HTML page of the URL is Assuming that “program_a” is set, it can be understood that the HTML generation program 29 to be started is “program_a”. If the URL acquired from the HTML display request is “url_b”, the premise of the setting file 25 (the URL is “url_b” in the setting file 25, and the HTML generation program 29 for generating the HTML page of the URL is Assuming that “program_b” is set), it can be understood that the HTML generation program 29 to be started is “program_b”. Through the above processing, a specific HTML generation program 29 can be started from a plurality of HTML generation programs 29. Thereafter, the CPU 5 generates an HTML page by causing a rule confirmation unit 31, an original URL acquisition unit 33, a display HTML determination unit 35, and an HTML generation unit 37 in the HTML generation program 29 to be described later to execute each process. .

  FIG. 5 is a flowchart of the process (of each processing unit) of the HTML generation program 29. The flowchart represents a flow of processing when generating an HTML page of a correct block. Hereinafter, a process from generation of the HTML generation program 29 to generation of an HTML page and transmission of the HTML page will be described with reference to FIG. As described above, the HTML generation program 29 provided in the large-capacity storage 9 describes the URL of the correct transition source HTML page and the URL of the correct transition destination HTML page.

  First, the CPU 5 of the maze display server 3 determines whether or not a rule is set in the HTML generation program corresponding to the URL (current URL) that has received the HTML display request (S101).

  When the rules (reward conditions) are set, the CPU 5 performs a process corresponding to each rule (S105). The processing in steps S101 and S105 is performed by the rule confirmation unit 31 of the HTML generation program 29. For example, if the rule is a cookie rule, the cookie (cookie () obtained by the personal computer 1 during WEB surfing from the user personal computer 1 that has transmitted an HTML display request to a specific URL (current URL). (Reward requirement) is acquired (reward requirement acquisition means), and it is determined whether or not the cookie satisfies the rule (reward condition determination means).

  If the rule is not set or the conditions of each rule are satisfied as a result of the processing of the rule confirmation unit 31, the CPU 5 acquires the URL of the transition source HTML page from the HTML display request (access source URL acquisition means). ) And stored in the memory 7 (S102). The process of step S102 is performed by the original URL acquisition unit 33.

  Next, the CPU 5 acquires the URL of the transition source HTML page from the memory 7, and acquires the acquired URL and the URL of the correct transition source HTML page preset in the display HTML determination unit 35 of the HTML generation program 29. And determine whether or not the correct route has been changed in order (access source determination means) (S103). The process of step S103 is performed by the display HTML determination unit 35.

  As a result of the processing of the display HTML determination unit 35, when it can be determined that the correct route has been shifted in order, the CPU 5 generates a correct route upper page including the URL of the correct HTML page as a link (WEB page). Generating means) (S104). On the other hand, if the HTML generation unit 37 does not satisfy the rule condition in the process of step S105, the CPU 5 generates a page on the wrong route that does not include the link of the correct HTML page of the transition destination (WEB page generation means). (S106). Similarly, if it can be determined in step S103 that the wrong route has been transitioned, the CPU 5 creates a page on the wrong route that does not include the URL of the correct HTML page as the link (WEB page creation means) ( S106). In step S105, different HTML pages are generated depending on whether the rule is satisfied or not. For example, an HTML page including a link of a correct HTML page that is the destination of the correct transition destination is generated only when the rule is satisfied and the correct route is a transition, and when the rule is satisfied but is not a correct route transition, a correct transition is generated. An HTML page that does not include the link of the previous HTML page may be generated. The HTML generation unit 37 performs the processes in steps S104 and S106.

  Thereafter, the generated HTML page is transmitted to the user personal computer 1 accessing the current URL (WEB page transmission means) (S107).

  The above is the processing flow of the HTML generation program 29 that generates the HTML page of the correct block. The above processing flow is the same for the signpost block and the goal block. The HTML generation program 29 for generating the start page and the page on the wrong route existing alone generates an HTML page having a link other than the HTML page on the correct route as a transition destination.

  FIG. 6 is a device configuration diagram for advertising using a virtual maze on the WEB. In order to realize the operation of the virtual maze and the advertisement function, one or a plurality of maze display servers 3, one or a plurality of user personal computers 1, and a WEB server 41 of one or a plurality of advertisers are included. Each device can communicate with the Internet network 300. For example, a function as an advertisement may be realized by linking a specific HTML page generated by the maze display server 3 with an advertisement HTML page of the advertiser's WEB server 41.

  FIG. 7 is an image diagram illustrating an example of operation combining a virtual maze operation and an advertising function. By using the characteristics of the virtual maze that changes the content of the HTML page that is the transition destination by the URL of the HTML page that is the transition source, the advertisement of the HTML page that is the transition destination is changed by the advertisement of the HTML page that is the transition source It is also possible. Hereinafter, a specific advertisement example will be described with reference to FIG.

  As the transition source HTML page, there is an HTML page whose URL is “A” and an HTML page whose URL is “B”. The HTML page whose URL is “A” is an advertisement page of “A coffee”. The HTML page with the URL “B” is an advertisement page with “B snack”. On the other hand, as a transition destination of those HTML pages, there is a block whose URL is “C”. Talent advertisements are placed on the HTML page in the block whose URL is “C”. In the case of the above assumption, in the case of transition from the advertisement page of “A coffee” to the advertisement page of the talent, the advertisement page of “talent with A coffee” is displayed, and the advertisement page of “B snack” is displayed. In the case of the transition to the advertisement page, an advertisement page of “talent only” is displayed. As described above, the advertisement content of the HTML page that is the transition destination can be changed according to the content of the transition source HTML page. Furthermore, it is also possible to perform an advertisement that associates the advertisement content of the transition source HTML page with the advertisement content of the HTML page that is the transition destination.

  FIG. 8 is a device configuration diagram for constructing a virtual maze on the WEB. As a device on the side of constructing and maintaining a virtual maze, there are a maze creation server 51 and a producer computer 400. Each device can communicate with the Internet network 300. The maze creation server 51 is a server that mainly creates and edits the HTML generation program 29. The HTML generation program 29 and the setting file 25 created by the maze creation server 51 are distributed to one or a plurality of maze display servers 3 via the Internet network 300. The CPU 5 of the maze display server 3 generates an HTML page corresponding to the HTML display request from the user by executing the HTML generation program 29. The creator computer 400 is a computer used by the creator of the virtual maze, and is a device for performing maintenance such as editing a link between a plurality of HTML pages forming the virtual maze and adding a rule. .

  FIG. 9 is a detailed configuration diagram of the maze creation server 51. The maze creation server 51 includes a CPU 53, a memory 55 as a storage unit, and a large capacity storage 61, and each element is connected to a bus 59. Further, a network interface 57 is connected to the bus 59. Each element transmits information, commands, and the like between the elements via the bus 59. It is connected to the Internet network 300 via the network interface 57. The large-capacity storage 61 includes a maze part area 73, a maze completed product area 85, and a maze creation program 63.

  The maze part area 73 provided in the large-capacity storage 61 is an area for storing a template such as contents for creating the HTML generation program 87 and an HTML generation program 87 in the middle of completion. The maze part area 73 includes a basic object storage area 75, a template storage area 77, a template embedded object storage area 79, and a content storage area 81.

  The basic object storage area 75 is an area for saving an object being created (HTML generation program 87) created by a basic object creation process 65 described later. The template storage area 77 is an area for storing a program (template program) that is a template of the HTML generation program 87. For example, a template of an HTML generation program 87 for generating an HTML page of a correct block is included. Here, “the template of the HTML generation program 87 for generating the HTML page of the correct block” means that the URL of the transition source HTML page obtained when the current URL is accessed from the transition source HTML page is: It is determined whether or not it corresponds to the URL of the correct transition source HTML page described in the HTML generation program 87. As a result of this determination, if it can be determined that the transition is from the correct transition source HTML page, When an HTML page including the URL of the correct transition destination HTML page is generated as the HTML page corresponding to the current URL, and it is determined that the transition is not from the correct transition source HTML page as a result of the determination, it corresponds to the current URL. HTML page that does not include the correct HTML page URL as the HTML page A basic function processing unit for causing a computer to execute processing to be generated; and a URL identifier description area for describing URL identifier set information including the URL of the transition source HTML page and the URL of the transition destination HTML page. ing. Further, in the case of an HTML generation program 87 that generates an HTML page to which a rule is added, a rule program or the like is also stored in the template storage area 77 in advance. The template embedding object storage area 79 is an area for storing an object that is being created, created by a template embedding process 67 described later. The content storage area 81 is an area for storing parts (program descriptions, etc.) relating to the appearance (design) of the font and background of the HTML page.

  The maze completed product area 85 provided in the large-capacity storage 61 includes one or a plurality of HTML generation programs 87 and a setting file 89. The producer distributes the HTML generation program 87 and the setting file 89 to the predetermined maze display server 3 from the maze completed product area 85.

  A maze creation program 63 provided in the large-capacity storage 61 is a program for creating and designing an HTML generation program 87 for generating an HTML page. The maze creation program 63 can operate the virtual maze by distributing and executing the HTML generation program 87, which is a completed form of the created object, to each maze display server 3. Here, the maze creation program 63 includes a basic object creation process 65, a template embedding process 67, and a content embedding process 69. The basic object creation process 65, the template embedding process 67, and the content embedding process 69 will be described with reference to FIGS.

  Based on FIG. 10, the outline of the flow of the maze creation program 63 including the basic object creation process 65, the template embedding process 67, and the content embedding process 69 will be described. When the CPU 53 of the maze creation server 51 starts the maze creation program 63, the creation process of the HTML generation program 87 starts.

  First, the CPU 53 executes a basic object creation process 65. Then, the CPU 53 creates, on the memory 55 of the maze creation server 51, a plurality of objects that are not described at all, such as programs, which are the basis of the HTML generation program 87. Further, the plurality of objects on the memory 55 are referred to each other. And the object arrange | positioned on a correct route is specified. Thereafter, the correct route is identified from the plurality of links referred to each other, and then the incorrect route is edited. Thereafter, the CPU 53 saves the object on the memory 55 in the basic object storage area 75. Thus, the basic object creation process 65 is completed. Details of the basic object creation processing 65 will be described with reference to FIGS. 11 and 12.

  Next, the CPU 53 executes a template embedding process 67. The CPU 53 expands the object stored in the basic object storage area 75 on the memory 55. Then, the object developed on the memory 55 and the template of the HTML generation program 87 stored in advance in the template storage area 77 are synthesized. In addition, when a rule is added to the object, the object and a program template related to the rule are synthesized. Thereafter, the CPU 53 saves the object on the memory 55 in the template embedded object storage area 79. Thus, the template embedding process 67 is completed. Details of the template embedding process 67 will be described with reference to FIG.

  Finally, the CPU 53 executes content embedding processing. First, the CPU 53 expands the object stored in the template embedded object storage area 79 on the memory 55. Then, the CPU 53 synthesizes the object and an object relating to a design such as the appearance of the HTML page, which is stored in the content storage area 81 in advance. Furthermore, the input of the URL (local URL) of the HTML page created by the object (HTML generation program 87) is received and written in the program section of the object. After that, the URL of the transition destination HTML page is written as a link in the program part of the object. Further, when the object is to generate a correct route upper page, a signpost page, and a goal page, the URL of the previous HTML page on the correct route is written in the program section of the object. Subsequently, the setting file 89 associates the own URL with an object for generating an HTML page of the URL. Then, the object on the memory 55 that has been set as described above is stored in the maze completed product area 85 as an HTML generation program 87, and the setting file 89 is also stored in the maze completed product area 85. The content embedding process 69 is completed and the HTML generation program 87 is completed. Details of this process will be described with reference to FIG.

  The detailed flow of the basic object creation process 65, the template embedding process 67, and the content embedding process 69 described in FIG. 10 based on FIGS. 11, 12, 13, and 14 below. explain.

  FIG. 11 is a diagram showing a detailed flow of the basic object creation processing 65, and FIG. 12 is an image diagram showing the change of the object when the basic object creation processing 65 is processed. Details of the basic object creation processing 65 will be described with reference to FIGS.

  The process starts when the CPU 53 of the maze creation server 51 executes the basic object creation process 65. First, the CPU 53 receives an input of the number of objects from the producer as to how many objects are to be created (S301). The object is a prototype of the HTML generation program 87 for generating an HTML page, and the completed form of the object is the HTML generation program 87. Although illustration is omitted, it is assumed that there is a screen for receiving an input from the producer, how many objects are prepared in a specific stage.

  Thereafter, the CPU 53 creates as many objects as the number received from the producer on the memory 55 (S302). For example, when the producer inputs “4” on the screen, the CPU 53 creates four objects on the memory 55 by the processes in steps S301 and S302 (see S401 in FIG. 12). In the image of S401 in FIG. 12, four square pictures are represented as created objects.

  Next, the CPU 53 refers to all of the plurality of objects created on the memory 55 in step S302 (S303). For example, a link is made from one object to all other objects, and a link is made from one other object to all other objects. The “link” at this stage is not a specific HTML page URL. These are virtual links that are mutually referenced on the memory. In the above example, when four objects are created, a link is made from one object to the other three objects. If the link is a route, a route of 3 (number of routes) × 4 (number of objects) = 12 is created (see S402 in FIG. 12). In the image of S402 in FIG. 12, a solid line arrow connecting the objects represents the route.

  Then, the CPU 53 receives an input of the number of objects from the producer as to how many objects among the plurality of objects are arranged on the correct route (S304). Although illustration is omitted, selection of an arbitrary number of objects on the GUI (Graphical User Interface) is accepted from the producer.

  Thereafter, the CPU 53 arbitrarily determines as many objects as the number received from the producer in step S304, and specifies that the objects are to be placed on the correct route (S305). Here, the CPU 53 arranges all the objects on the circumference in the memory 55, and the correct route of the objects corresponding to the number of the inputs received counterclockwise (or clockwise) from the start point of the objects. You may make it specify that it is an object arrange | positioned above. Specifically, a flag that can recognize that the object is an object that generates a correct block, a signpost block, a goal block, and a start page is set for the corresponding object. The process of setting this flag is required when combining the template and object of the program for generating each HTML page in the subsequent process. In addition, an object that does not have any other flag can be recognized as an object that is not placed on the correct route (an HTML generation program 87 for generating a page on the wrong route that exists alone). A specific image is as shown in S403 of FIG. In the image of S403 in FIG. 12, the hatched object represents an object specified to be arranged on the correct route, and a simple square picture object represents an object to be arranged on the wrong route.

  After the process of step S305, the CPU 53 specifies the correct route from among the links between all the objects on the memory 55 (S306). In the processing of step S305, since the object on the correct route has already been specified, the shortest route connecting the objects on the correct route is specified as the correct route. For example, in the process of step S305, when the CPU 53 specifies that the number of objects for which input has been received is placed on the correct route in the counterclockwise or clockwise direction, the counterclockwise or clockwise It can be easily identified that the route around is the correct route. In the image of S404 in FIG. 12, among the arrows connecting the objects, the dotted arrow indicates the correct route identified, and the solid arrow indicates the incorrect route.

  Next, the CPU 53 accepts editing of an incorrect route from the producer. In addition, the CPU 53 edits on the memory the wrong route that has been accepted for editing such as deletion from the producer (S307). By setting all routes other than the correct route as wrong routes, there is a possibility that the difficulty level of the virtual maze may become too high, and management may be troublesome. Therefore, the number of wrong routes can be reduced or increased in some cases (see S405 in FIG. 12). In the image of S405 in FIG. 12, four incorrect routes are deleted and edited from the total of 12 routes including the correct route.

  As for the method of editing the wrong route, a maintenance screen as shown in FIG. 15 may be displayed on the GUI of the producer computer 400 or the like, and editing such as addition and deletion of the wrong route may be accepted. Here, FIG. 15 will be described. FIG. 15 is an image (one example) of a GUI used when a virtual maze maker edits a wrong route or the like. When there are multiple stages, the screen is switched by tag. A plurality of square pictures S1P0 to S1P5 represent each object (HTML generation program 87) and are regularly named. Further, among the plurality of objects, the hatched object is an object for generating an HTML page on the correct route. A dotted arrow indicates a correct route, and a normal arrow indicates an incorrect route. The producer can delete or add a wrong route by clicking or dragging on the GUI with the mouse.

  Here, a supplementary explanation will be given for editing the route. In the case of a block, either one of two HTML pages having the same URL depending on the condition is displayed. (In FIG. 15, a picture in which objects are doubled represents a block.) In this virtual maze, the transition destination URL embedded in the page on the wrong route in each block and another HTML of the same URL Although different from the transition destination URL embedded in the page, the wrong route is not edited separately. Taking the correct answer block as an example, the difference between the link embedded in the correct route upper page of the same URL and the link embedded in the incorrect route upper page is the link to the HTML page on the next correct route. The difference is whether or not it contains. The link to the wrong route upper page itself is common in the two HTML pages. Here, there is a case where the URL of an appropriate HTML page that does not actually exist is embedded as a transition destination link (false route) in the page on the wrong route to confuse the user and make the virtual maze interesting.

  Finally, the CPU 53 saves the object on the memory 55 in the basic object storage area 75, and ends the basic object creation process 65 (S308).

  Here, when there are a plurality of virtual maze stages to be constructed instead of one, the processes in steps S301 to S308 are repeated for each stage.

  Next, the flow of processing for the template embedding processing 67 will be described in detail with reference to FIG. The CPU 53 of the maze creation server 51 starts the process by executing the template embedding process 67 after the basic object creation process 65 is completed.

  First, the CPU 53 expands an object in the basic object storage area 75 on the memory 55 (S501).

  Next, the CPU 53 receives selection of an object for which a rule is set from the producer (S502). Rules may be set for all objects or not at all. As a specific object selection method, a maintenance screen as shown in FIG. 15 is displayed on a GUI such as the producer computer 400, and the selection of an object is accepted from the producer on the GUI.

  Subsequently, the CPU 53 specifies an object to which a rule that has been selected in the process of step S502 is added (S503). Specifically, a flag (description) that can be determined to be an object to which a rule is added is written in the program portion of the corresponding object.

  Then, after the process of step S503, the CPU 53 receives a selection from the producer as to what type of rule is set for the object to which the rule is added (S504). Regarding the types of rules, as described in FIG. 5, there are “timer rules”, “user input confirmation rules”, “cookie rules” and the like.

  Thereafter, the CPU 53 sets a flag so that the type of rule can be determined for the object that has been determined which type of rule is added in step S504 (S505).

  Here, the CPU 53 receives a determination as to whether or not the specification of the object to which the rule is added and the specification of the type of the rule to be added have been completed for all the objects to which the rule is added from the producer (S506). If the specification of the object to which the rule is added and the specification of the type of the rule to be added are not completed, the process returns to step S502. If the rule is completed, the process proceeds to the subsequent processes.

  Next, the CPU 53 synthesizes all the objects and the template of the HTML generation program 87 in the template storage area 77 on the memory 55 (S507). The template of the HTML generation program 87 is a template of the HTML generation program 87 for generating the HTML page in the correct block, the HTML page in the signpost block, the HTML page in the goal block, the start page, and the page on the wrong route. It is.

  Further, the object to which the rule specified in step S503 is added and the template of various rules in the template storage area 77 are synthesized on the memory 55 (S508).

  Finally, the CPU 53 saves the object on the memory 55 in the template embedding object storage area 79, and ends the template embedding process 67 (S509).

  If there are a plurality of virtual maze stages to be constructed instead of one, the processes in steps S501 to S509 are repeated for each stage.

  Details of the flow of the content embedding process 69 will be described with reference to FIG. The CPU 53 starts processing by executing the content embedding process 67 after the template embedding process 67 described above is completed.

  First, the CPU 53 of the maze creation server 51 expands an object on the memory 55 from the template embedded object storage area 79 (S601).

  Next, the CPU 53 accepts matching (selection) from the producer as to which content is to be embedded in each object (S602).

  Then, an HTML page screen design, a story to be placed on the HTML page, a template of content such as an advertisement, and an object, which are stored in advance in the content storage area 81, are combined on the memory (S603). For a file that cannot be combined with an object, such as an image file, a program description indicating the storage location of the image is added to the corresponding object (the image and the object are linked).

  Thereafter, the CPU 53 receives the URL of the HTML page generated by the completed object (HTML generation program 87) from the producer (name of the maze display server 3 that is the distribution destination, fictitious storage destination directory, and name of an arbitrary HTML page). Is input and written in the program part of the object (S604). As described above, the HTML page does not already exist, but is generated when a user makes an HTML display request. Therefore, a fictitious directory is set as the storage destination directory. The URL of each HTML page is determined by the processing in step S604.

  Here, the CPU 53 receives from the producer a determination as to whether or not the composition of the content and the object and the determination of the own URL of the HTML page have been completed (S605). If the processing has not been completed for all objects, the process returns to step S602, and if completed, the process proceeds to the subsequent processes.

  Next, the CPU 53 writes the URL of the transition destination link for each object in the program part of each object based on the route determined in the basic object creation processing 65 (S606). By the processing in step S606, the URL of the HTML page that is the transition destination of each HTML page is determined.

  Then, based on the route determined in the basic object creation processing 65, the CPU 53 corrects the correct answer immediately before the HTML page generated by this object for the object for generating the correct route upper page, signpost page, and goal page. The URL of the HTML page (transition source) on the route (the URL of the correct HTML page of the transition source) is written in the program portion of the corresponding object (S607).

  Subsequently, the CPU 53 determines a file name when each object is stored, and creates a setting file 89 for associating the object with the file name with the own URL written in the program section of the object (S608). When determining the file name when saving each object, the file name is determined regularly. For example, “S1P0” is used for the object that generates the start page of stage 1, and “S1P1” is used for the object that generates the next page on the correct route.

  Finally, the CPU 53 saves the object in the maze completed product area 85 as an HTML generation program 87, and also saves the setting file 89 (S609).

  Here, when there are a plurality of virtual maze stages to be constructed instead of one, the processes in steps S601 to S609 are repeated for each stage.

  As described above, the creation of the HTML generation program 87 is completed by the processes described with reference to FIGS.

  In addition, there is a process of embedding the URL of the transition source HTML page and the URL of the transition destination HTML page in the object in step S606 and step S607, but for the template program, the transition source HTML is as follows. There is also a method of creating the HTML generation program 87 by describing the URL of the page and the URL of the transition destination HTML page. The process will be described below.

  As a premise for explanation, the program identifier is an identifier for uniquely identifying the HTML generation program 87. The URL identifier set information refers to information including the URL of the transition source HTML page and the URL of the transition destination HTML page associated with the program identifier, and is referred to as a maze definition. It is assumed that the maze definition is stored in advance in the large capacity storage 61 or the memory 55.

  First, the CPU 53 of the maze creation server 51 reads URL identifier set information associated with a specific program identifier from the maze definition.

  Next, the CPU 53 describes the read URL identifier set information in the template program.

  Further, the template program describing the URL identifier set information is used as an HTML generation program, and the HTML generation program 87 and the program identifier are associated with each other and stored in the maze completed product area 85.

  According to the present embodiment, it is possible to control the transition between the HTML pages of the user by using the request header field. Furthermore, in order to control between the HTML pages, there is no need to prepare a database or the like for storing information of the transition source HTML page. Therefore, a virtual maze can be freely constructed and operated using a plurality of WEB servers without being tied to a single WEB server.

  In addition, in the case of use in a virtual maze, game characteristics are important. In a maze where the user can find and guess the correct route by looking at the HTML language description and URL of the HTML page, the fun of the game is impaired. Therefore, as described above, the setting file 89 associates the URL with the HTML generation program 87 to be activated when a request to display the HTML page of the URL is made. By using the setting file 89, it is possible to hide the correct route from the URL by the user by changing the URL at an appropriate timing or making it irregular. is there. Further, the request header field mechanism restricts access to the HTML page when the URL is directly entered in the URL input field of the Internet browser, so that the game performance is not impaired.

  When using the virtual maze mechanism and using it as an advertisement, it is possible to link to the advertiser's WEB server 41, but using the HTML page mechanism that has the two-sided nature of the block described above. Depending on the order of access and the HTML page of the transition source, the advertisement to be displayed can be changed.

  Furthermore, when constructing a virtual maze, it is relatively easy for the user to give minimal information (such as the number of HTML pages created in one stage and the number of HTML pages placed on the correct route). It is possible to create an HTML generation program 87 for creating an HTML page. Also, by preparing a GUI (Graphical User Interface) screen for editing links and the like, maintenance can be performed relatively easily.

Conceptual diagram of virtual maze on WEB Supplementary diagram about transition between blocks System configuration diagram (in the case of game operation) Maze display server configuration diagram Flow chart of processing of an HTML generation program for generating an HTML page of a correct block System configuration diagram (when game operation is combined with advertising function) Image of game operation combined with advertising function System configuration diagram (when building a maze) Maze creation server configuration diagram Overview of maze creation program processing Basic object creation process flowchart Image of basic object creation process Flow chart of template embedding process Flow chart of content embedding process Image of maintenance screen

Explanation of symbols

1 User personal computer 3 Maze display server 5 CPU
7 Memory 9 Mass storage 11 Network interface 13 Bus 17 HTML request acceptance reply application 25, 89 Setting file 27 HTML generation program group 29, 87 HTML generation program 31 Rule confirmation unit 33 Original URL acquisition unit 35 Display HTML determination unit 37 HTML Generation unit 41 Advertiser WEB server 51 Maze creation server 53 CPU
55 Memory 57 Network interface 59 Bus 61 Mass storage 63 Maze creation program 65 Basic object creation processing 67 Template embedding processing 69 Content embedding processing 73 Maze component area 75 Basic object storage area 77 Template storage area 79 Template embedded object storage Area 81 Content storage area 85 Maze completed product area 300 Internet network 400 Producer computer

Claims (3)

  A storage unit that stores a correct access source URL and a correct access destination URL in advance; an access source URL acquisition unit that acquires a URL of the access source WEB page when the current URL is accessed from the access source WEB page; Access source determination means for determining whether or not the acquired access source URL is a correct access source URL stored in the storage means, and if the result of this determination is a correct access source, it corresponds to the current URL. A WEB page including the correct access destination URL is generated as a WEB page, and if the result of the determination is not a correct access source, a WEB page not including the correct access destination URL is generated as a WEB page corresponding to the current URL. The page generation means and the generated WEB page Maze providing system on the WEB, characterized in that a WEB page sending means to send to the access to the terminal in the URL. The maze providing system according to claim 1,
In the storage means, predetermined reward conditions are stored in advance,
Reward requirement acquisition means for acquiring a reward requirement obtained by the terminal during WEB surfing from the access source terminal when the current URL is accessed, and whether the acquired reward requirement satisfies the predetermined reward condition A reward condition judging means for judging,
The maze providing system on the WEB, wherein the WEB page generating means generates different WEB pages depending on whether the reward condition is satisfied or not. A storage unit that stores a template program and a maze definition of a WEB page generation program in advance, stores the WEB page generation program in association with a program identifier, and a creation unit for creating the WEB page generation program.
The template program determines whether or not the access source URL acquired when the current URL is accessed from the access source WEB page corresponds to the identifier of the correct access source URL described in the WEB page generation program If the result of this determination is the correct access source, a WEB page including the identifier of the correct access destination URL is generated as the WEB page corresponding to the current URL. A basic function processing unit that causes a computer to execute processing for generating a WEB page that does not include a correct access destination URL identifier as a WEB page corresponding to the URL, and a URL identifier set that includes the access source URL identifier and the access destination URL identifier URL identifier description area for describing information
The maze definition is a maze building system on WEB having URL identifier set information associated with a program identifier.
In the creation means,
A process of reading URL identifier set information associated with a specific program identifier from the maze definition;
A process of describing the read URL identifier set information in the URL identifier description area of the template program;
Processing the template program describing the URL identifier set information as a WEB page generation program, associating the WEB page generation program with the program identifier, and storing it in the storage means;
A maze building program on the WEB characterized in that is executed.

Images