JP2023114347A - Retrieval server, retrieval method, and program - Google Patents

Abstract

To retrieve or reserve an optimum golf course on the basis of participating members and play conditions even when a golf course, a rough area of the golf course, or a play date is not determined.SOLUTION: A user who intends to play golf with a plurality of persons sets a schedule candidate to create an event (step 601) and invites participant candidates who desire to participate in the created event. Specifically, a link with the participant candidate is shared, for example, a guide of the event is sent to the participant candidate who desires by mail or the like (step S602). The participant candidate who has received an event invitation mail accesses a server using a URL or the like attached to the mail to display an input screen, and each participant inputs a desired date of participation and a request (step S603), the golf course retrieval server retrieves a golf course candidate for example, for each schedule candidate, and creates and displays a list (step S604).SELECTED DRAWING: Figure 6

Description

The present invention relates to a search server, search method and program, and more specifically to a search server, search method and program for searching for or making a reservation for an exact golf course that meets desired conditions.

In Japan, there are many membership golf courses, and in the past, most golf courses were played by members or with members. The number of available golf courses has increased, and now it is possible to reserve and play at most golf courses, with the exception of some golf courses, via the Internet or telephone. For example, when holding a golf competition, simply by accessing the web and entering the necessary information, golf course reservations, invitation letter creation, score calculation, handicap calculation, award winners, etc. can be easily achieved. The purpose is to provide a golf competition support method that allows golf competitions to be held by acquiring in advance the guide information of a golf course where the golf competition will be held from the golf course, and providing the guide information to the user terminal when accessed from the user terminal. The user terminal selects a golf course from the guidance information and transmits service request information to the operator server. The operator server reserves the golf course selected by the user and provides competition support. In addition to notifying the golf course server, after the golf competition is held, the golf course terminal transmits the golf competition result information to the operator server, and the operator server generates the support result based on the golf competition result information, and the user terminal A golf competition support method and system, a golf competition support program, and a storage medium storing the golf competition support program have been proposed (see, for example, Patent Document 1).

On the other hand, when holding a meeting or event with multiple participants, it is complicated to coordinate schedules and venues with participants who do not communicate regularly. Systems have been provided to facilitate coordination. For example, for the purpose of reducing the work of the conference organizer by assisting in the coordination of the conference holding schedule, when the conference conditions are set by the conference organizer, the schedule management agent 840b of the invitee is provided with Query and obtain availability for a range of dates and times, determine the optimal meeting schedule based on each invitee's availability, and notify and confirm the meeting schedule to the meeting organizer and to the invitee; A conference holding agent that notifies the holding of a conference has been proposed (see, for example, Patent Document 2).

Furthermore, when traveling by car, such as golf, it is conceivable that the car owner will let a non-car owner or a car owner who cannot provide a car for some reason ride with them. Due to the trend to reduce the number of cars as much as possible, there is an increasing number of people using private cars to travel together, with the aim of reducing the number of cars used as much as possible. . For example, in a vehicle ride-sharing support system that supports ride-sharing on the outbound and return trips, a plurality of user terminals 2 possessed by users are connected via a network 3 for the purpose of facilitating the creation of a ride-sharing group on the return trip. A car-sharing support system 1 for supporting car-sharing on a return trip, in which a plurality of first return-trip drivers, who are drivers of a back-trip, are set from among users based on ride-sharing application information, and a first return-trip car-sharing group is established. Create multiple, create the first return trip operation schedule, and after creating the first return trip operation schedule, based on the ride-sharing application information and the information of the first return trip driver, the outbound trip so as to include all of the first return trip driver set multiple outbound drivers, create multiple outbound ride-sharing groups, create an outbound route operation schedule, create a reservation result based on the outbound route operation schedule and the first return route operation schedule, and make a reservation on the user terminal A vehicle passenger support system 1 that transmits results has been proposed (see, for example, Patent Document 3).

Japanese Patent Application Laid-Open No. 2002-222288 JP-A-9-91341 Japanese Patent Application Laid-Open No. 2020-135282

However, in the conventional information processing apparatus as described in Patent Document 1, golf course reservations can be made under various conditions. Alternatively, the search is performed after the play date is decided, and for example, it is not possible to respond to cases where only candidates for participating members are decided and the golf course or general golf course area is decided, or the play date is not decided. There is a problem. In addition, despite the fact that transportation to the golf course is mostly done by car, it is necessary for the car provider to decide which car of the participants will ride in accordance with the reservation of the golf course, and when to pick them up. There is a problem that it is necessary for the concerned parties to make adjustments each time by telephone or e-mail.

The present invention has been made in view of the above-mentioned conventional problems. To provide a search server, search method, and program capable of searching for or making a reservation for an optimum golf course based on playing conditions and play conditions.

The invention described in claim 1 is a search server that searches a golf course database for playable golf courses according to a predetermined condition, and is a travel time required to reach a golf course desired by a participant. travel time receiving means for receiving a specified travel time; position searching means for acquiring position information of a participant and searching a golf course database for a golf course reachable within the specified travel time from the position indicated by the position information; and a playable search means for searching for a playable golf course which has a vacancy after the designated travel time from among the golf courses registered.

According to a second aspect of the present invention, the search server according to the first aspect further comprises reservation means for reserving the searched playable golf course.

3. The search server according to claim 1 or 2, wherein the designated travel time is a time interval required for the participant to travel from the current position to the golf course.

The invention according to claim 4 is the search server according to any one of claims 1 to 3, wherein there are a plurality of participants, and the position search means is configured so that all the participants from the positions indicated by the position information of the plurality of participants searches golf courses that can be reached within a specified range of specified travel times.

The invention according to claim 5 is the search server according to any one of claims 1 to 4, wherein the position search means is based on the position information of the participant, and is reachable within the specified travel time using a predetermined means of transportation. It is characterized by searching golf courses within the range.

According to a sixth aspect of the present invention, there is provided the search server according to the fifth aspect, wherein the position information of the participants includes information on the closest station to the positions of the participants, and the golf course database stores information about each golf course from a station to a predetermined location. It is characterized by including travel time that can be reached using transportation means.

A seventh aspect of the invention is the search server according to any one of the first to sixth aspects, wherein the playable search means uses an API of an external golf course search system.

The invention according to claim 8 is the search server according to any one of claims 1 to 7, further comprising condition receiving means for receiving participation conditions of the participants, wherein the playable search means receives the received participation conditions. It is characterized by searching for satisfying golf courses.

The invention according to claim 9 is the search server according to any one of claims 1 to 8, characterized in that the specified travel time is within a predetermined time range.

According to a tenth aspect of the invention, there is provided a search method for searching a playable golf course from a golf course database according to a predetermined condition, which is the travel time required to reach the golf course desired by the participant. travel time receiving means for receiving a specified travel time; position searching means for acquiring position information of a participant and searching a golf course database for a golf course reachable within the specified travel time from the position indicated by the position information; and a playable search means for searching for a playable golf course which has a vacancy after the designated travel time from among the golf courses registered.

According to an eleventh aspect of the invention, there is provided a program for causing a computer to execute a search method for searching a playable golf course from a golf course database according to a predetermined condition, the search method being a golf course desired by a participant. Travel time receiving means for receiving a specified travel time, which is the travel time required to reach a golf course; It is characterized by having a position search means for searching from a field database and a playable search means for searching for playable golf courses that are available after a specified travel time from the searched golf courses.

According to a twelfth aspect of the invention, there is provided a search server that searches a golf course database for playable golf courses according to predetermined conditions, and provides participation condition input means to a plurality of participants who wish to play. Participant information acquisition means for acquiring participant information and entered participation conditions of a plurality of participants, and from the participant information and participation conditions of a plurality of participants, a search is made from a golf course database to find golf course and event schedule candidates. Candidate determination means for determining and storing determination results in a database, and play searching means for searching playable golf courses and schedules in each schedule candidate for the determined golf course candidates.

The invention according to claim 13 is the search server according to claim 12, wherein the candidate determining means can reach within a predetermined range of travel time from the position indicated by the position information of each of the plurality of participants. A golf course is searched from a golf course database, and the search result is determined as a golf course candidate.

According to the fourteenth aspect of the invention, in the search server according to the thirteenth aspect, a combination of a car owner among the participants and a fellow passenger who wishes to ride in the car is obtained by searching the positional information of the participants or searching. It is characterized by further comprising fellow passenger setting means for setting based on the positional information of the golf course.

The invention according to claim 15 is the search server according to any one of claims 11 to 14, wherein the candidate determination means includes list display means for displaying participants and golf course candidates for each schedule candidate. characterized by

According to a sixteenth aspect of the invention, there is provided a search server for searching a playable golf course from a golf course database according to a predetermined condition, the search server searching for a playable golf course on a desired schedule for a desired golf course candidate. participant information acquisition means for acquiring participant information including location information of a plurality of participants and entered participation conditions; and among the participants, a car owner who wishes to ride in the car with him/her. and a fellow passenger setting means for setting a fellow passenger combination with a passenger who wishes to ride on the basis of the position information of the participant or the searched position information of the golf course.

According to a seventeenth aspect of the invention, there is provided a search server according to the sixteenth aspect of the present invention, for a combination of rides, based on the location information of the participants and the location information of the searched golf course, the person who wishes to ride together in the car is selected. It is characterized by further comprising pick-up time calculating means for calculating pick-up time.

According to the present invention, a travel time receiving means for receiving a specified travel time, which is a travel time required to reach a golf course desired by a participant, acquires the position information of the participant, and calculates the distance from the position indicated by the position information. A position search means for searching a golf course reachable within a specified travel time from a golf course database, and a playable search means for searching for a playable golf course that has a vacancy after the specified travel time from among the searched golf courses. characterized by comprising

According to the second aspect of the invention, the search server according to the first aspect further comprises reservation means for reserving the retrieved playable golf course. Even when the play date is not fixed, the optimum golf course can be searched or reserved based on the participating members and playing conditions.

1 is an overall system configuration diagram of an embodiment of the present invention; FIG. 1 is a functional block diagram of an example of a golf course search server and a client terminal according to an embodiment of the present invention; FIG. It is a figure which shows an example of the initial screen of the golf course search system of one Embodiment of this invention. It is a figure which shows an example of the member registration application screen of one Embodiment of this invention. It is a flow chart which shows an example of member information registration processing of one embodiment of the present invention. 4 is a flow chart showing an example of overall golf course search processing according to one embodiment of the present invention. FIG. 10 is a diagram showing an example of a calendar screen for inputting candidate dates in golf course search according to one embodiment of the present invention; It is a figure which shows an example of a participation schedule of a participant in the golf course search of one Embodiment of this invention, and a desired input screen of a golf course. It is a figure which shows an example of a participation schedule of a participant in the golf course search of one Embodiment of this invention, and a desired input screen of a golf course. It is a figure which shows an example of a participation schedule of a participant in the golf course search of one Embodiment of this invention, and a desired input screen of a golf course. 4 is a flow chart showing an example of a series of processes from golf course plan search to extraction of an appropriate golf course in the golf course search according to one embodiment of the present invention. It is a figure which shows an example of the participation schedule list display screen for every participant in the golf course search of one Embodiment of this invention. It is a figure which shows an example of the list display screen of the golf course search result of one Embodiment of this invention. It is a figure which shows an example of the display screens, such as a golf course route, of each participant of the golf course search result of one Embodiment of this invention. 4 is a flow chart showing an example of golf course candidate list generation processing in the golf course search according to one embodiment of the present invention. FIG. 4 is a diagram for explaining an example of a method of calculating the arrival time from the position of each participant to each golf course according to one embodiment of the present invention; It is a flowchart which shows an example of the calculation process of the arrival time from each participant's position to each golf course of one Embodiment of this invention. 4 is a flowchart showing an example of travel schedule calculation processing in golf course search according to one embodiment of the present invention. 4 is a flow chart showing an example of processing for setting golf course selection conditions based on the wishes of a plurality of participants in the golf course search according to one embodiment of the present invention. It is a figure which shows an example of the condition edit screen of golf course selection conditions in the golf course search of one Embodiment of this invention. 9 is a flow chart showing another example of fellow passenger combination processing in golf course search according to one embodiment of the present invention. 8 is a flow chart showing another example of golf course determination processing in golf course search according to one embodiment of the present invention. 8 is a flow chart showing another example of the process of calculating the arrival time from the position of each participant to each golf course according to one embodiment of the present invention. It is a flow chart which shows an example of a series of processing from login to golf course determination and reservation in a golf course search according to another embodiment of the present invention.

Hereinafter, embodiments of a search server, a search method, and a program according to the present invention will be described with reference to the drawings. In addition, even in different drawings, the same reference numerals are used to indicate the same processing and configuration.

The present invention searches for a desired golf course using search items that have not existed in the past, and makes a reservation. You can search for golf courses to play. Here, golf is generally a sport played by a team of four people, and can be played by a plurality of teams in a competition format. A golf course search may be performed for the purpose of playing as a group, or a golf course search may be performed for the purpose of inviting participants to hold a golf competition with a plurality of groups. In the specification of the present application, first, a system (first embodiment) for retrieving suitable golf course candidates by adjusting the schedule when playing with a plurality of players, that is, two or more players, regardless of whether or not there is a competition. Next, a system (second embodiment) for searching a golf course by setting arrival time to the golf course will be described, but both embodiments can be applied to each other. That is, it is possible to search for a golf course by setting a desired arrival time from each participant while adjusting the schedule of the participants.

(First embodiment)
(System configuration)
In this embodiment, as shown in FIG. 1, processing necessary for searching golf courses or providing reservations, such as transmission/reception with each terminal, data management, reception of search requests, search execution processing, and various information output processing, is executed. A golf course search server 101 is connected to a network, and is connected to user-side client terminals 111 and 112 and a golf course reservation server 121 via a network 103 . In this embodiment, the functions of this server 101 can also be provided to each terminal through the cloud. In this case, each terminal uses a browser or a dedicated application to mainly perform input and display processing, and data management and various processing are basically performed on the server. Any configuration known in the art may be used, such as providing directly to clients, terminals, etc. via a dedicated network.

As servers, in addition to the golf course search server 101, various servers that provide various services known in the technical field can be provided. In addition, various databases including a golf course database (not shown) storing data of each golf course are provided, and various data required in this embodiment can be stored in the database.

In this embodiment, client terminals 111 and 112 are used as terminals on the user side, and various conditions can be set to search golf courses. It can be used for inputting personal information of participants and reservations.

In order to provide the service, the provider of the golf course reservation service uses the golf course reservation server 121 provided by an external company to check availability of reservations for the golf course candidates searched under the conditions relating to the position. The golf course reservation server 121 is set with an interface for checking the presence or absence, acquiring additional information about the golf course, and making a reservation for the golf course. However, the golf course reservation server 101 may be provided with a necessary database to perform golf course reservation processing.

The terminals 111 and 112 are basically wirelessly connected to the network 103, and can be smartphones, tablet terminals, or the like, but can also be mobile personal computers, for example. Here, in this embodiment, the connection with the network 103 can be made through a mobile phone line, Wi-fi, BLUETOOTH (registered trademark), or other wireless network. If you can access the system, display the input screen, and perform certain input operations with a touch panel, mouse or keyboard, you can use any device such as a tablet terminal, a mobile or desktop computer, and a dedicated terminal.

Further, as a server that mainly executes the processing related to the golf course search service of this embodiment, only the golf course search server 101 performs the processing. You can also let

FIG. 2 is a functional block diagram of the server and client terminal of one embodiment of the present invention. The golf course search server 101 receives access from the client terminal 111, receives personal information and participant information, stores them in a database, and manages them. A golf course candidate search module 202 searches for golf course candidates by calculating the arrival time to each golf course from the position, or searches for golf course candidates under various conditions. It has a list generation module 203 that obtains and generates a list of golf course candidates with vacancies, and a golf course reservation module 204 that reserves a finally determined golf course from the golf course candidates.

On the other hand, the client terminal 111 includes a data input management module 205 for inputting information about the client and managing the input information about the client, a data transmission/reception module 206 for transmitting/receiving various data, and a list for searching and reserving golf courses. and a data display module 207 for displaying the .

FIG. 6 is a flow chart showing an example of the overall golf course search processing according to one embodiment of the present invention. In this embodiment, when two or more players play, it is possible to accurately adjust the schedule and search for appropriate golf course candidates. Specifically, the golf course search server of the present embodiment has only candidates for participating members determined, but does not determine a specific golf course that the candidate wants to play. Candidate golf courses are searched based on certain rules when it is not possible to make an appropriate selection, such as whether it is convenient for each participant candidate to search for a golf course and whether it is easy to play. In addition, when only the participant candidates are decided and the play date is not decided, the schedule can be adjusted, for example, the play date can be set according to the schedule with the largest number of participants. That is, as shown in FIG. 3, in the present embodiment, when only the participant candidates are decided, along with supporting the decision of the schedule, candidates of golf courses that are suitable for all the participants who can participate in the decided schedule are found. By searching, it is possible to assist the user or organizer who desires to reserve a golf course.

(Member registration process of this embodiment)
First, with regard to preprocessing before using the golf course search server 101 used in an embodiment of the present invention, member registration processing of the present embodiment will be described with reference to FIGS. FIG. 3 is a diagram showing an example of the initial screen of the golf course search system according to one embodiment of the present invention. FIG. 4 is a diagram showing an example of a member registration application screen according to one embodiment of the present invention, and FIG. 5 is a flow chart showing an example of member information registration processing according to this embodiment. When the client terminal 111 connects to the golf course search server 101 via a network using a browser or a dedicated application (step S501), the client information reception module 201 of the golf course search server 101 first displays the initial screen shown in FIG. , a member registration screen 401 including a mobile phone number input field 402 and a password input field 403 is transmitted to the terminal (step S502) and displayed (step S503).

When the mobile phone number is entered and the send button 404 is touched (step S504), a temporary registration screen (not shown) is sent to the terminal by short mail (step S505), and any procedure known in the technical field is sent. You can register as a member at In the present embodiment, temporary registration is performed using a mobile phone number and main registration is performed. However, any member registration method known in the technical field can be used. Also, although the mobile phone number is used to identify the user here, it is not limited to this, and an e-mail address or other identification information can also be used. In the present embodiment, membership registration can be performed through the procedure described above, but the present invention is not limited to this, and other procedures can be used, or advance membership registration can be dispensed with.

As the overall processing of this embodiment, as shown in FIG. 6, first, a user who intends to play golf with a plurality of people sets a schedule candidate, creates an event (step 601), and creates an event. Invite potential participants who wish to participate. Specifically, the link with the participant candidate is shared, for example, the event information is sent to the desired participant candidate by e-mail or the like (step S602). It is also possible to register candidates and set candidates for the schedule. A participant candidate who has received the event invitation mail accesses the server using the URL attached to the mail, and an input screen as shown in FIGS. When a desired participation date and request are entered (step S603), the golf course search server of the present embodiment searches golf course candidates for each schedule candidate, for example, and creates and displays a list (step S604). The user or the organizer determines the desired schedule and golf course from the number of participants and participants of each schedule candidate and the golf course candidate, and makes a reservation (step S605). Characteristic processing of the golf course search server of the present embodiment will be described below along with the overall flow described above.

(Participant recruitment process of the present embodiment)
The participant recruiting process of this embodiment will be described with reference to FIGS. That is, processing for preparing various data that is a prerequisite for searching for a golf course in this embodiment is performed. FIG. 6 is a flow chart showing an example of the overall golf course search processing according to one embodiment of the present invention, and FIGS. It is a diagram. FIG. 7 is a diagram showing an example of a calendar screen for inputting candidate dates for golf course search according to one embodiment of the present invention.

Referring to FIG. 6, first, a user or organizer who wishes to play golf with a plurality of people enters desired schedule candidates 703, such as schedules that the user can play, on a calendar 702 on a candidate date registration screen 701 shown in FIG. 705 or the like is entered to set a schedule candidate, an event is created (step S601), and participant candidates who wish to participate in the created event are invited. Specifically, the link is shared with the participant candidates, for example, the event information is sent to the desired participant candidates by e-mail or the like (step S602). connects to a golf course search server 101 via a network, registers participant information of desired participant candidates such as golf friends such as acquaintances and colleagues, and players who have previously participated in a golf competition, and sets candidates for the schedule. You can also In this embodiment, the schedule is explained as a date, but it is not limited to this, and can be a range of "morning" or "afternoon" of a predetermined date or a specific time. The registered participant information can include, in addition to ordinary personal information such as name and address, wishes and conditions regarding the golf course and play. In this embodiment, the organizer or the user invites the participant candidates by e-mail. Either method can be used.

A participant candidate who has received the event invitation email accesses the server using the URL attached to the email, and displays a participation schedule entry screen 801 as shown in FIGS. is displayed, and when basic information such as a nickname 802 is entered, a screen for selecting schedules in which participation is possible as shown in FIG. 9 is displayed. On this screen, the participant candidate can set whether or not to participate 902 for each date 901, for example, as "O" for participation, "X" for non-participation, and "△" for undecided. can set attendance (step S603). On the screen shown in FIG. 9, information on the nearest station 903 can be selected, for example, from a pull-down menu, and the nearest station can be set. In addition, automobile-related information 904, for example, "possible to provide with owning a car", "possessing a car but not allowed to ride with", "would like to ride with", etc., can be selected. can be set, but the above information can also be set in advance when entering the information of the participant candidates.

In addition, as shown in FIG. 10, the participant candidate can also add desired conditions for the golf course. For example, it is possible to set the area 1001 of the golf course, the play fee 1002, the start time or the start order or time 1003 in the case of multiple groups, the play style 1004 such as with lunch or skip, and other exclusion settings 1005. , the user can review the group settings and reservation conditions in consideration of these wishes. When a schedule candidate is determined and each participant is asked to enter a desired participation date and request, a golf course plan that can be played is searched for each schedule to determine a golf course, and a user list is generated and displayed as a list. do. In the golf course search server of this embodiment, for example, a participation schedule list display screen for each participant candidate as shown in FIG. A golf course candidate is searched, and a list is created and displayed (step S604). Further, an appropriate golf course is selected from the positional relationship between the participants and the golf course, and a golf course candidate list screen 1301 as shown in FIG. 13 is displayed. A desired date and golf course are determined from the candidates and a reservation is made (step S605). Here, in this embodiment, the appropriate golf course is the location of all the participants, for example, a golf course that is easy to participate from their homes, for example, a golf course that all the participants can reach within two hours from their homes. It is not only a golf course that maximizes the overall profit and the arrival time of each participant is within a predetermined range and is fair, but also by methods known in the art, regions and participants In consideration of the attributes of each, the convenience of each can be considered, and various weights can be applied for determination. However, if there is no available reservation, that fact is displayed and the list is not displayed, or a list of 0 golf course candidates is displayed.

Golf course candidate list screen 1301 displays golf course information 1302 such as photographs and outlines of each candidate golf course, which serves as a reference for golf course selection. The golf course information may be stored in advance in a golf course database, or may be obtained from other companies' golf course reservation sites or the golf course's own home page, or any other method known in this technical field may be used. can. A reservation button 1303 is provided at the bottom of the outline display column of each golf course, and a golf course can be determined and a reservation can be made. A golf course reservation is made by setting the schedule and the number of participants, and using the golf course reservation server 121 provided by an external company. A reservation can be made from the golf course search server 101 using an interface such as an API for making a reservation for a golf course. Further, the golf course candidate list screen 1301 can display, for example, 2 hours and 55 minutes as the guideline 1304 of the boarding time to the displayed golf course.

(Golf course determination processing of the present embodiment)
When the participant candidate inputs the information about the schedule in which they wish to participate, the process of determining the schedule and the golf course is executed with the support of the golf course search server 101 used in one embodiment of the present invention. will be described with reference to FIGS. FIG. 11 is a flowchart showing an example of a series of processes from golf course plan search to selection of an appropriate golf course in the golf course search according to one embodiment of the present invention. FIG. 12 shows a golf course search according to this embodiment. is a diagram showing an example of a participation schedule list display screen for each participant in . FIG. 13 is a diagram showing an example of a list display screen of golf course search results according to one embodiment of the present invention. FIG. 14 is a diagram showing an example of a golf course route, etc. display screen for each participant in the golf course search results according to one embodiment of the present invention.

The client terminal 111 is connected to the golf course search server 101 via a network using a browser, a dedicated application, or the like. A participation schedule list 1202 as shown is displayed, and participation is indicated by "O", non-participation is indicated by "X", and undecided is indicated by "△" in participation presence/absence column 1204 for each participant candidate 1203 and each schedule candidate. The total number of participants is also shown in , making it easy to understand which schedule has more participants and what kind of participation candidates want to participate. This allows the user or organizer to determine the schedule from this list. Here, a search button 1205 is set for each date on the upper part of the participation schedule list 1202. By pressing the search button 1205, a golf course plan that can be attended and reserved on that date is searched by a method described in detail below. Search (step S1101). At this time, the weather, the degree of difficulty of the course, the degree of completeness of the facilities, the presence or absence of a caddy, the contents of the meal, and other various conditions known in the technical field can be taken into account in the search. The above conditions include golf course area 1001, play fee 1002, start time or start order or time 1003 in the case of multiple groups, play style 1004 such as with lunch or skip, and other exclusions. Preferences such as settings 1005 can also be considered. Furthermore, this condition can be set in consideration of the elements of golf courses popular with women (course rating, topic, beautiful facilities, reservation status for women). When the search is executed, the golf course reservation server 121 is used to search for a golf course plan that satisfies the desired golf course plan, and the golf course plan list 1301 is displayed (step S1102).

Next, since most people travel to the golf course by car, it is determined whether all of the candidate participants have cars and will participate by driving, or whether some of the participants wish to ride together. (step S1103), and if there is a participant candidate who needs to ride together (No in step S1103), the travel time of all combinations of the car provider and the fellow passenger who ride together to the golf course is calculated (step S1104), and The combination that minimizes the total travel time is adopted (step S1105). A specific description will be given with reference to FIG. FIG. 15 is a flow chart showing an example of fellow-passenger combination processing in a golf course search according to an embodiment of the present invention. As described above, when a participant candidate wishes to participate, information related to a car is specified, such as "possible to provide with car", "own car but not allowed to ride", "hope to ride with", etc. Therefore, the participant candidates who can be provided by owning a car and the participant candidates who wish to ride together are extracted (step S1501). The arrival time of each vehicle is calculated for a predetermined combination of each of the extracted participant candidates and the person who wishes to ride together, and the total time is calculated by totaling them (step S1502). The total time is calculated for all combinations, and the combination with the shortest total time is recommended (step S1503). For example, referring to FIG. 16, when heading to golf course X 1601, car providers α 1605 and γ 1608 and passenger β 1606 first set 10 routes for car provider α 1605 to ride fellow passenger β 1606. minutes + 10 minutes (between bases) + 15 minutes x 2 (round trip) + 120 minutes (between base and golf course) = 170 minutes, the route taken by car provider γ1608 alone is 10 minutes (between home and nearest station) + 140 minutes (Between base and golf course)=150 minutes, and the average travel time of the two cars is 160 minutes (pattern 1). On the other hand, as the second group, the route in which the car provider γ 1608 rides the passenger β 1606 who wishes to ride together is 10 minutes + 40 minutes (between bases) + 15 minutes x 2 (round trip) + 120 minutes (between bases and golf course) = 200 minutes. The route that person α 1605 travels alone is 10 minutes (between home and nearest station) + 100 minutes (between base and golf course) = 110 minutes, and the average travel time of two cars is 155 minutes (pattern 2). Therefore, under the above conditions, the boarding combination of pattern 2, which is the second group, is recommended.

As will be described later, the generated combination is calculated by calculating the travel time between the fellow passenger and the golf course backwards from the scheduled play time by the same method as the method for calculating the travel time between the participant candidate and the golf course, as will be described later. can be calculated to calculate the pick-up time. As a result, the car owner can use the calculated pick-up time as an indication of the time to pick up the fellow passenger. When the combination of riding together is determined, the average travel time of all participants to the golf course is calculated (step S1106). That is, to explain an example of the processing shown in FIG. 17, for example, as shown in FIG. 10 minutes, which is the nearest base time, is calculated, and 15 minutes, which is the nearest base time from participant β 1606 to the nearest base B 1603, is calculated for movement from the home of participant β 1606 in area B to golf course X 1601. 1608 in the area C to the golf course X1601, the nearest base time from the participant γ1608 to the nearest base C1607, which is 10 minutes, is calculated (step S1701). Next, 100 minutes, which is the arrival time from base A 1603 in area A to golf course X 1601 to which one desires to move, is obtained, and 120 minutes, which is the arrival time from base B 1604 in area B to golf course X 1601 to which one wishes to move, is obtained. 140 minutes, which is the arrival time from the base C1607 in the area C to the desired golf course X1601 (step S1702). Finally, by adding the nearest base time and arrival time, the travel time from each participant to golf course X1601 is calculated, and the travel time from the home of participant α1605 in area A to golf course X1601 is 110 minutes. , 135 minutes for the movement of the participant β 1606 in the area B to the golf course X 1601 from the home, and 150 minutes for the movement of the participant γ 1608 in the area C to the golf course X 1601 from the home (step S1703). Similarly, for golf course Y 1602, 10 minutes, which is the nearest base time from participant α 1605 to the nearest base A 1603, is calculated. 15 minutes, which is the nearest base time from β1606 to the nearest base B1603, is calculated. 10 minutes, which is base time, is calculated. Next, 120 minutes, which is the arrival time from base A 1603 in area A to golf course Y 1602 to which one wishes to move, is acquired, and 100 minutes, which is the arrival time from base B 1604 in area B to golf course Y 1602 to which one wishes to move, is obtained. 200 minutes, which is the arrival time from the base C1607 in the area C to the desired golf course Y1602. Finally, the travel time from each participant to the golf course Y 1602 is calculated by adding the nearest base time and arrival time, and the travel time from the home of the participant α 1605 in the area A to the golf course Y 1602 is 130 minutes. It takes 115 minutes to move from the home of participant β1606 in area B to golf course Y1602, and 210 minutes to move from the home of participant γ1608 in area C to golf course Y1602.

As described above, it is possible to acquire the arrival time when each participant moves to golf course X1601 and golf course Y1602. , a more accurate travel time can be calculated by also considering the travel time between bases. In addition, the nearest station time to base A1603, base B1604, and base C1607, which are the nearest stations, can be added to the travel time from the participant information of participant α1605, participant β1606, and participant γ1608. In this calculation example, it is possible to use a JR station or a subway station as a base, but it is not limited to this. can be further increased.

Since the travel time of each participant to golf course X1601 and golf course Y1602 can be obtained, the average travel times of all the participants to golf course X1601 and golf course Y1602 are calculated to be 131 minutes and 151 minutes, respectively. Therefore, for example, golf course X1601, which has a shorter average travel time, can be adopted as an appropriate golf course. It is also possible to adopt the golf course that minimizes the standard deviation of the travel time of each participant from the average travel time. In this example, golf course X1601 is adopted in both cases, but the adoption criteria are not limited to this, and the adoption criteria can be set based on the travel time of each participant by a method known in the technical field. can. As described above, only golf courses to which all participants can reach within a predetermined range of the calculated average travel time are extracted (step S1107). When there is no desired golf course among the golf course candidates searched on the designated schedule, the user can return to the participation schedule list 1202, search for a golf course on another date, and further confirm the golf course candidates. With the support as described above, the user or the organizer can examine the golf course candidates, the number of participants, etc., and determine the schedule and the golf course. can.

Furthermore, in the present embodiment, when the golf course is determined, the route to the golf course, pick-up order, departure time, etc. are calculated, and as shown in the golf course route display screen of FIG. For each vehicle provided, the route, departure time, boarding time, etc. 1402-1404 can be displayed, as described below.

(Migration schedule creation processing of this embodiment)
In general, after the golf course search and reservation are completed, transportation to the golf course is mostly done by automobile. Create a schedule, present it in addition to a combination plan for riding in a car, and support the golf course search and reservation procedure. Specifically, it is possible to calculate the departure time and golf course arrival time of each car provider and provide a display screen such as the golf course route of each participant as shown in FIG. 14 in advance. It can be used as a reference for when it is necessary to pick up a fellow passenger. A method of calculating the departure time of the car provider and the golf course arrival time will be described below with reference to FIG.

FIG. 18 is a flow chart showing an example of travel schedule calculation processing in a golf course search according to one embodiment of the present invention. Since the travel time differs depending on whether or not the participant candidate to whom the car is provided has a fellow passenger, it is first determined whether or not there is a fellow passenger (step S1801). The time from the nearest station of the candidate to the base is added (step S1802), and the time from the base to the golf course is added (step S1803). As described above, the travel time to the golf course when there is no fellow passenger, that is, when the traveler travels alone, is acquired. On the other hand, if there is a fellow passenger (Yes in step S1801), the time from the nearest station of the participant candidate to the base is added (step S1804), and the time from the base to the base of the fellow passenger is added (step S1805). , the round trip time to the passenger's base is added (step S1806), and the time from the base to the golf course is added (step S1807). As described above, the travel time to the golf course when there is a fellow passenger and moves while picking up the fellow passenger is acquired. Finally, the travel time from the nearest station to the golf course is calculated backward from the play schedule time to calculate the departure time (step S1808), thereby obtaining the departure time of each car provider and the like, as shown in FIG. 14, for example. A display screen such as golf course route of each participant can be provided in advance. In addition to the actual play start time, the scheduled play time may include time for preparation after arriving at the golf course, practice time, and the like.

As described above, in the present embodiment, when two or more people play together, it is possible to adjust the schedule and search for appropriate golf course candidates. Since it is possible to recommend golf courses and present travel schedules, etc., golf course searches and reservations can be made in detail according to the wishes of each participant candidate.

(Example of setting golf course selection conditions in this embodiment)
As described above, a plurality of candidate participants can set desired conditions for the golf course when replying to participate. As shown in FIGS. It is processed by rules and set as golf course selection conditions when searching for a golf course. FIG. 19 is a flowchart showing an example of processing for setting golf course selection conditions based on the wishes of a plurality of participants in the golf course search according to one embodiment of the present invention, and FIG. It is a figure which shows an example of the condition edit screen of golf course selection conditions in . The process of setting golf course selection conditions based on the wishes of a plurality of participants will be described with reference to FIGS. 19 and 20. FIG. When setting the desired schedule as described above, each participant candidate, for example, as shown in FIG. 1003, play style 1004 such as with lunch or through, and other exclusion settings 1005 can be set, and the above information is acquired by the golf course search server 101 (step S1901). Since the acquired wishes of each participant candidate are different, in order to search golf courses considering these wishes, it is necessary to match the acquired wishes with the conditions that the candidate participants can accept as a whole. , determine golf course selection conditions according to a predetermined rule (step S1902). Predetermined rules are, for example, as multiple people's wishes, the desired condition of participant candidate A is through play; If the desired condition of C is riverbed exclusion, the golf course selection conditions can be determined as through play; riverbed exclusion; fee of 15,000 yen or less.

However, since the predetermined rules may not always be appropriate, the determined selection conditions are displayed as shown in FIG. 20 (step S1903) so that the user or organizer can further edit the conditions. be able to. FIG. 20 displays an edit screen 2001 including a desired date 2002, area 2003, play fee 2004, specified travel time 2005, and the like. The user or the organizer views the determined selection conditions on the condition edit screen 2001 to confirm the contents, and if it is determined that there is no need to change the conditions (No in step S1904), this processing ends and the determination is made. The golf course search is performed according to the selection conditions. On the other hand, if it is determined that the conditions need to be changed (Yes in step S1904), the conditions are corrected to appropriate conditions on the condition edit screen 2001, and the contents are displayed (step S1905). In this case, the corrected selection conditions are set as search items, and a golf course search is performed. In this embodiment, as a selection condition determination rule, for example, when there are multiple requests for fees, the price is adjusted to a lower request, and if there are no contradictory requests, the specified request is adopted. Any rule known in the art can be used without limitation.

In this embodiment, various wishes of a plurality of participant candidates can be appropriately adjusted and used as selection conditions when searching for a golf course.

(Another example of fellow passenger combination processing of this embodiment)
In the present embodiment, as described above, it is possible to present proposals for car companion combinations to assist with golf course searches and reservation procedures, but other examples of fellow passenger combination processing can also be used. FIG. 21 is a flowchart showing another example of fellow passenger combination processing in golf course search according to one embodiment of the present invention. As described above, when a participant candidate wishes to participate, information related to a car is specified, such as "possible to provide with car", "own car but not allowed to ride", "hope to ride with", etc. Therefore, the participant candidates who can be provided by owning a car and the participant candidates who wish to ride together are extracted (steps S2101 and S2102). If there is a case where there is position information within the same base area among the extracted participant candidates (Yes in step S2103), the car owner and the person who wishes to ride together in the same base area are set to ride together (step S2104). If there is no car owner in the area of the same base as the person who wishes to ride together, and if there is a person who wishes to ride together between the car owner and the searched golf course (Yes in step S2105), A person who wishes to ride together is set to ride together (step S2106). If there is no combination, confirm with all car owners whether they can ride together even if it is a detour. Although the combination of fellow passengers in the car can be automatically generated by the above processing, the above combination is presented as a fixed reference, so it is possible to make separate adjustments depending on individual circumstances, acquaintances, and the like. Also, in this example, the combination is determined based on the bases described above, but is not limited to this. Candidates can also be combined. Also, in this example, an example in which one person rides in one car is shown, but it is also possible to deal with a plurality of people by designating the number of people who can ride in the same car with the owner of the car.

For the combination generated as described above, the travel time between the passenger and the golf course is calculated backward from the scheduled play time by the same method as the method for calculating the travel time between the candidate participant and the golf course, Pick-up time can be calculated. As a result, the car owner can use the calculated pick-up time as an indication of the time to pick up the fellow passenger.

(Another example of golf course determination processing according to the present embodiment)
In this embodiment, the appropriate golf course can be determined by the golf course determination process described above, but another example of the golf course determination process can also be used. That is, when a date in the participation schedule list 1202 is designated, position information of participation candidates who can participate in the play is obtained, and a suitable golf course for the participant on that date is searched.

Another example of golf course candidate list generation processing and golf course determination processing according to the present embodiment will be described below with reference to FIGS. FIG. 22 is a flowchart showing another example of golf course determination processing in the golf course search according to one embodiment of the present invention. FIG. 16 is a diagram for explaining an example of a method of calculating the arrival time from each participant's position to each golf course according to one embodiment of the present invention, and FIG. 10 is a flow chart showing another example of processing for calculating arrival time from a person's position to each golf course.

When the date is specified in step S1104 of the flowchart shown in FIG. 11 and the participant candidates scheduled to participate are specified, the position information of the participants on the specified schedule is acquired (step S2201), and the position information of the participant candidates is obtained. And from the position information of the golf course information stored in the golf course database, each participant searches for golf course candidates that can be reached within a predetermined time range (step S2202). In this embodiment, the arrival time is used instead of the distance between the participant candidate and the golf course. Any travel time calculation method can be used, but in the present embodiment, an efficient method, which will be described later, is used to save processing time and resources while calculating the travel time. With the method described above, it is possible to search for golf course candidates that are highly convenient for the participant based on arrival time instead of geographical distance. In this embodiment, the travel time is calculated using a car as a means of transportation, but it is not limited to this, and it is also possible to use trains and club buses as means of transportation, or to mix trains and cars according to the participants. It can also be calculated by any of the modes of transportation known in the art, such as airplanes and ships. Here, in this technical field, the arrival time usually uses a predetermined time according to the means of transportation. can be applied to this embodiment to adjust the time.

When searching for a golf course by calculating the travel time, a predetermined range, such as within two hours or between one and a half hours and two and a half hours, is specified, and each participant candidate travels from home or office within that range. It is also possible to search golf courses that can be reached from such positions, and to extract fair golf courses that can be reached within a predetermined travel time of each participant candidate. By such processing, for example, golf courses in each possible time range such as 1 to 2 hours and 3 to 4 hours are searched for each schedule, and the golf courses acquired in all time ranges are used as golf course candidates. can be done. Golf course candidates acquired by the above processing are arranged in a predetermined order, for example, in order of play fees, in order of golfer's evaluation, or in order of facility adequacy. The candidates are listed as shown in the candidate list 1301 (step S2203).

Next, with reference to FIGS. 22 and 23 for an efficient travel time calculation method of this example, from participant α 1605 and participant β 1606 in area A to golf course X 1601 and golf course Y 1602 shown in FIG. A method for calculating the travel time of . Base A 1603 and base B 1604 are reference points for calculating the travel time from the position of the participant to the golf course, and in the example shown in FIG. 16, stations such as JR or subway are used. The travel time between each base and the golf course and the travel time between bases are set in advance by any method known in the technical field. In addition, the travel time between the base and the participant can be calculated using the nearest station time received in the attendance confirmation information, or can be calculated in advance or in real time from the address.

Referring to FIG. 23, the case of moving from participant α 1605 in area A to golf course Y 1602 will be described. Since it cannot be obtained, the inter-base time from base A1603, which is the nearest station of the participant, to base B1604, which is the base station for which the travel time to the golf course is set (step S2301). Acquire the arrival time from base B 1604, which is the base station where the travel time to the golf course is set, to the desired golf course Y 1602 (step S2302), and add the time to the nearest station, the time between bases, and the arrival time. By doing so, the travel time from the participant to each golf course is calculated (step S2303). As described above, it is possible to acquire the arrival time when moving from the participant α 1605 in the area A to the golf course Y 1602. The nearest station is the base station where the participant's travel time to the golf course is set. In this case, there is no need to consider travel time between bases. Also, the nearest station time from the participant information of participant α1605 to base A1603, which is the nearest station, can be added to the travel time. The golf course determination process of this example can also be used to search for a golf course plan first as described above and then select an appropriate golf course. It is also possible to determine a golf course candidate and search for a golf course plan that meets the desired conditions with vacancies for reservation.

(Second embodiment)
This embodiment basically has the same configuration as the above-described first embodiment, and the functions and configurations of each terminal are also the same. In the first embodiment, basically, when a plurality of play participants, that is, two or more players play, the schedule is adjusted, and a more accurate golf course candidate that is convenient for movement among all the participant candidates is searched. However, in this embodiment, regardless of the number of participants, the arrival time to the golf course is set and a golf course that can be reached within a predetermined arrival time range is searched. , golf courses that can be played from now on can be searched using arrival time as a key. That is, as a simpler form of the principle of the present invention of searching golf courses based on arrival time, there is no adjustment of participant candidates, etc., which is different from the above-described first embodiment.

The golf course search server of this embodiment will be described with reference to FIG. FIG. 24 is a flow chart showing an example of a series of processes from login to golf course determination and reservation in a golf course search according to another embodiment of the present invention. First, the user logs in to the system (step S2401), and inputs how many hours from now he will play golf or the desired travel time from home (step S2402). When the time is specified, the user's position information is obtained, and from this position information and the position information of the golf course information stored in the golf course database, golf course candidates that can be reached within the set time are searched. to display a list of searched golf course candidates (step S2403). The arrival time to the golf course can be calculated using any of the golf course candidate search processes of the first embodiment described above.

In this embodiment as well, the arrival time is used instead of the distance between the user and the golf course. Any calculation method can be used, but in the present embodiment, the travel time can be calculated by saving processing time and resources by an efficient method as described above. Specifically, as shown in FIGS. 16 and 23, the inter-base time from base A 1603, which is the nearest station of the participant, to base B 1604, which is the base station where the travel time to the golf course is set, is calculated. (Step S2301). Acquire the arrival time from base B 1604, which is the base station where the travel time to the golf course is set, to the desired golf course Y 1602 (step S2302), and add the time to the nearest station, the time between bases, and the arrival time. By doing so, the travel time from the participant to each golf course is calculated (step S2303). A desired golf course is selected from the displayed golf courses and reserved (step S2304).

With the above method, it is possible to detect possible golf courses based on travel time rather than travel distance, so even if you do not have information on nearby golf courses, you can play golf accurately. You can search for places. In this embodiment, the travel time is calculated using a car as a means of transportation, but it is not limited to this, and it is also possible to use trains and club buses as means of transportation, or to mix trains and cars according to the participants. It can also be calculated by any of the modes of transportation known in the art, such as airplanes and ships.

According to a first aspect of the invention, there is provided a search server for searching a playable golf course from a golf course database according to a predetermined condition received from a client terminal connected via a network. Location information is obtained by using a travel time receiving means for receiving a specified travel time, which is a travel time required to reach a desired golf course, and storing the travel time in a memory , and the participant's location information obtained in advance from the client terminal. Golf courses that can be reached within the specified travel time read from the memory from the indicated location are read out from the golf course database , the location information of each golf course is read, each travel time is obtained, and the golf courses included in the range of the specified travel time are searched. position search means for storing information on the relevant golf course in a memory ; reading the information on the golf course from the memory; It is characterized by comprising a playable search means for searching a database for recording reservation information for golf courses that are open and playable after the designated travel time.

The invention according to claim 5 is the search server according to any one of claims 1 to 4, characterized in that the designated travel time is the time when the user travels using a predetermined means of transportation.

According to a sixth aspect of the present invention, there is provided the search server according to the fifth aspect, wherein the location information of the participants includes information on the closest station to the locations of the participants, and the golf course database stores the nearest stations for each golf course. It is characterized by including the travel time that can be reached from the station using the predetermined means of transportation.

According to a seventh aspect of the present invention, in the search server according to any one of claims 1 to 6, the playable search means uses an API of an external golf course reservation server to search for available and playable golf courses. It is characterized by searching golf courses .

The invention according to claim 9 is the search server according to any one of claims 1 to 8,
The designated travel time is characterized by being within a predetermined time range.
According to a tenth aspect of the invention, in the search server according to any one of the first to ninth aspects, the designated travel time is a reachable travel time from the location of the participant to the nearest station. It is characterized by being obtained by adding travel times that can be reached from the nearest station .
According to the invention of claim 11, in the search server according to any one of claims 1 to 10, participation condition input means is provided to a plurality of participants who desire to play, and the participant information of the participants and the entered condition are provided. Participant information acquiring means for acquiring participation conditions, and from the participant information and participation conditions of a plurality of participants, a golf course database is searched to determine golf course and schedule candidates, and the decision results are stored in the database. and a playable search means for searching golf courses that have openings and are playable for the schedule candidates.
According to a twelfth aspect of the invention, in the search server according to any one of claims 1 to 11, a combination of a car owner and a person who wishes to ride in the car among the participants, It is characterized by further comprising fellow passenger setting means for setting based on the position information of the participant or the searched position information of the golf course.

According to a thirteenth aspect of the invention, there is provided a search method in which a computer searches a golf course database for playable golf courses according to predetermined conditions received from a client terminal connected via a network. A travel time reception step of receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant, and storing the travel time in a memory ; Golf courses that can be reached within the specified travel time read from the memory from the position indicated by the information are read out from the golf course database to obtain each travel time, and the golf courses included in the range of the specified travel time. and storing information of the corresponding golf course in a memory , reading the information of the golf course from the memory, confirming whether or not there is an available reservation for the searched golf course, and receiving the specified travel time. and a playable search step of searching a database for recording reservation information for golf courses that are open and playable after a specified travel time from the point in time when the reservation is made.

According to a fourteenth aspect of the present invention, there is provided a program for causing a computer to execute a search method for searching a playable golf course from a golf course database according to a predetermined condition received from a client terminal connected via a network. , the search method includes a travel time receiving step of receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant, from the client terminal and storing the travel time in a memory; Using the position information of the person, the golf course that can be reached within the specified travel time read from the memory from the position indicated by the position information is read from the golf course database, the position information of each golf course is read, and each travel time is acquired and specified. A position search step of searching for a golf course included in a travel time range and storing information of the relevant golf course in a memory, and reading out the information of the golf course from the memory and determining whether or not the searched golf course is available for reservation. is confirmed, and there is a playable search step of searching a database for recording reservation information for a playable golf course which has a vacancy after the specified travel time from the time when the specified travel time is received .

According to the present invention, a travel time receiving means for receiving a specified travel time required to reach a golf course desired by a participant from a client terminal and storing the specified travel time in a memory; Using the position information of the person, the golf course that can be reached within the specified travel time read from the memory from the position indicated by the position information is read from the golf course database, the position information of each golf course is read, and each travel time is acquired and specified. Position searching means for searching for golf courses included in the travel time range and storing information on the corresponding golf courses in a memory, reading the information on the golf courses from the memory, and checking whether or not there are available reservations for the searched golf courses. A playable search means for searching a database for recording reservation information for a playable golf course that has a vacancy after the specified travel time from the time when the specified travel time is received is provided. Even when there are no specific golf course areas or even when the play date is not decided, the optimum golf course can be searched or reserved based on the participating members and playing conditions.

According to a first aspect of the invention, there is provided a search server for searching a playable golf course from a golf course database according to a predetermined condition received from a client terminal connected via a network. Location information is obtained by using a travel time receiving means for receiving a specified travel time, which is a travel time required to reach a desired golf course, and storing the travel time in a memory, and the participant's location information obtained in advance from the client terminal. Starting from the indicated position , the golf course that can be reached within the specified travel time read out from the memory from the current time is read from the golf course database to obtain each travel time, and the travel time is obtained within the range of the specified travel time. A position search means for searching the included golf courses and storing information on the corresponding golf courses in a memory, reading the information on the golf courses from the memory, checking whether there is a reservation vacancy for the searched golf courses, and specifying movement. It is characterized by comprising a playable search means for searching a database for recording reservation information for a playable golf course which is available after the specified travel time from the time when the time is received.

The invention according to claim 4 is the search server according to claim 1 or 2 , wherein there are a plurality of participants, and the position search means is configured such that all of the plurality of participants search from the positions indicated by the respective position information. It is characterized by searching golf courses that can be reached within a specified range of travel time.

According to the invention of claim 5, in the search server according to any one of claims 1 to 4 , a combination of a car owner and a passenger who wishes to ride in a car among the participants is It is characterized by further comprising fellow passenger setting means for setting based on the position information of the participant or the searched position information of the golf course.

According to a sixth aspect of the present invention, there is provided a search method in which a computer searches for playable golf courses from a golf course database according to predetermined conditions received from a client terminal connected via a network, the search method comprising: A travel time reception step of receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant, and storing the travel time in a memory; A golf course that can be reached within a specified travel time read out from the memory from the current position indicated by the information is read out from the golf course database to obtain each travel time, and the specified travel time is acquired. A position search step of searching golf courses included in a range and storing information of the relevant golf courses in a memory, reading the information of the golf courses from the memory, and confirming whether or not the searched golf courses have vacancies for reservations. and a playable search step of searching a database for recording reservation information for a playable golf course that is available after the specified travel time from the time when the specified travel time is received.

According to a seventh aspect of the present invention, there is provided a program for causing a computer to execute a search method for searching for a playable golf course from a golf course database according to predetermined conditions received from a client terminal connected via a network. , the search method includes a travel time receiving step of receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant, from the client terminal and storing the travel time in a memory; Using the positional information of each golf course, the positional information of each golf course is read out from the golf course database, and the golf course that can be reached within the specified travel time read from the memory from the present time starting from the position indicated by the positional information is read out and each travel is performed. a position search step of acquiring a time, searching for a golf course included in a range of a specified travel time, and storing information of the relevant golf course in a memory; and a playable search step of searching a database for recording reservation information for golf courses that are open and playable after the designated travel time from the time the designated travel time is received. Characterized by

According to the present invention, a travel time receiving means for receiving a specified travel time required to reach a golf course desired by a participant from a client terminal and storing the specified travel time in a memory; Using the positional information of each golf course, the positional information of each golf course is read out from the golf course database, and the golf course that can be reached within the specified travel time read from the memory from the present time starting from the position indicated by the positional information is read out and each travel is performed. A position search means for acquiring a time, searching for a golf course included in a range of a specified travel time, and storing information on the relevant golf course in a memory; A playable search means for confirming whether or not there is a vacant reservation, and searching a database for recording reservation information for golf courses that are vacant and playable after the specified travel time from the time when the specified travel time is received. Therefore, even when the golf course, the rough golf course area, or the playing date is not decided, the optimum golf course can be searched or reserved based on the participating members and playing conditions.

Claims (17)

A search server for searching a playable golf course from a golf course database according to predetermined conditions,
travel time receiving means for receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant;
a position search means for obtaining position information of a participant and searching the golf course database for a golf course reachable from the position indicated by the position information in the specified travel time;
a playable search means for searching for playable golf courses that are open after the specified travel time from the searched golf courses. 2. The search server according to claim 1, further comprising reservation means for reserving said searched playable golf course. 3. The search server according to claim 1, wherein the specified travel time is a time interval required for the participant to travel from the current position to the golf course. said participants are plural,
4. A golf course according to any one of claims 1 to 3, characterized in that said position searching means searches for a golf course that all of said plurality of participants can reach within a specified range of specified travel time from the position indicated by each position information. search server described in 5. A golf course according to any one of claims 1 to 4, wherein said position search means searches for a golf course within a reachable range within said designated travel time using a predetermined means of transportation from said position information of said participant. search server described in The location information of the participants includes information on the closest station to the locations of the participants, and the golf course database includes travel times that can be reached from stations using the predetermined means of transportation for each golf course. 6. The search server according to claim 5. 7. The search server according to any one of claims 1 to 6, wherein said playable search means uses an API of an external golf course search system. Further comprising condition receiving means for receiving participation conditions of the participants,
8. The search server according to any one of claims 1 to 7, wherein said playable search means searches for a golf course that satisfies said received participation condition. 9. The search server according to any one of claims 1 to 8, wherein said designated travel time is within a predetermined time range. A search method for searching a playable golf course from a golf course database according to predetermined conditions, comprising:
travel time receiving means for receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant;
a position search means for obtaining position information of a participant and searching the golf course database for a golf course reachable from the position indicated by the position information in the specified travel time;
a playable search means for searching for a playable golf course that has a vacancy after the specified travel time from the searched golf courses. A program for causing a computer to execute a search method for searching a playable golf course from a golf course database according to predetermined conditions, the search method comprising:
travel time receiving means for receiving a specified travel time, which is the travel time required to reach the golf course desired by the participant;
a position search means for obtaining position information of a participant and searching the golf course database for a golf course reachable from the position indicated by the position information in the specified travel time;
and playable search means for searching for playable golf courses that are open after the designated travel time from among the searched golf courses. A search server for searching a playable golf course from a golf course database according to predetermined conditions,
Participant information acquisition means for providing participation condition input means to a plurality of participants who desire to play, and acquiring participant information of the participants and the entered participation conditions;
Candidate determination means for searching the golf course database from the participant information and participation conditions of the plurality of participants to determine golf course and schedule candidates, and storing the decision results in the database;
A search server, comprising: play search means for searching playable golf courses and schedules for each event schedule candidate for the determined golf course candidates. The candidate determination means searches the golf course database for a golf course that can be reached within a predetermined range of travel time from the position indicated by the position information of each of the plurality of participants, and selects a golf course as the search result. 13. The search server according to claim 12, wherein the candidate is determined. a fellow passenger setting means for setting a combination of a car owner and a fellow passenger who wishes to ride in the car among the participants based on the position information of the participant or the searched golf course position information; 14. The search server of claim 13, further comprising. 15. The search server according to any one of claims 11 to 14, wherein said candidate determination means includes list display means for displaying participants and golf course candidates for each of said schedule candidates. A search server for searching a playable golf course from a golf course database according to predetermined conditions,
a play search means for searching playable golf courses on a desired schedule for a desired golf course candidate;
Participant information acquisition means for acquiring participant information including location information of a plurality of participants and input participation conditions;
A fellow passenger who sets a combination of a car owner and a fellow passenger who wishes to ride in the car among the participants based on the position information of the participant or the searched golf course position information. A search server comprising: setting means; The golf club is characterized by further comprising pick-up time calculation means for calculating a pick-up time for a person who wishes to ride together in a car based on the location information of the participant and the location information of the searched golf course for the ride combination. 17. The search server according to claim 16, wherein

Images