JP4192401B2 - Communication battle system and server device - Google Patents

Description

【００４０】
なお、Ｓｄｋは、対戦サーバ１０により予め設定される係数である。後述する各式におけるＳｘｘ（ｘｘは各項目に対応する文字を表す）も同様である。対戦サーバ１０は、状況によりＳｄｋ（Ｓｘｘ）の値を可変することにより最適な対戦者紹介を実現する。
【００４１】
「対戦時間」の項目については、「１対戦をこれ位の時間内でやりたい」という希望対戦時間を予め「３０分〜１８０分」１０分刻みで設定することができる。対戦サーバ１０（データベース１０ａ）には、各ユーザの過去の対戦データが記録されており、この対戦データから対戦候補者の普通の対戦時間（モード値）が求められている。「以内」「以上」の設定をすると絶対条件として処理し、「位」と設定すると対戦時間（モード値）をもとにして希望条件として重み値（Ｗｔｊ）がかけられた以下の（式−２）により希望対戦時間の相違度が算出される。
【００４２】
【数２】

【００４３】
「対戦頻度」の項目については、条件の近いユーザ同士が対戦相手として選択されやすいという傾向を回避するあるいは強調するためのもので、絶対条件として「１〜４週間以内」の範囲で一週間単位、または「１ケ月」で期間を設定でき、その期間について対戦が可能であるか否かを示す「○」または「×」を設定できる。すなわち「対戦頻度」に対する設定を可能とすることで、特定の対戦相手について対戦候補者として選択される優先度を上げるあるいは下げることができる。優先度を下げることで特定の相手との対戦ばかりで対戦が馴れ合いになることを防ぎ実力向上を助けることができ、また優先度を上げることで仲間を増やしたり親交を深めることができる。例えば図１６に示すように、絶対条件として「１週間」以内「×」と設定すると、１週間以内に対戦したことがあるユーザは対戦候補者から除外され、「１ケ月」以内「○」を設定すると１ケ月以内に対戦したユーザのみが対戦候補として残る。希望条件とする場合は、図１５〜図１７に示すようにして設定され、以下の（式−３）により対戦履歴から過去３０日間の対戦回数により相違度が算出される。
【００４４】
Ｄｆｒ＝（ＭＣＰＣ／ＭＰＣ）＊Ｓｆｒ＊Ｗｆｒ 式−３
ＭＣＰＣ：過去３０日の候補との対戦回数、ＭＰＣ：過去３０日の本人の対戦回数
「国籍」の項目については、絶対条件では「○」か「×」かの何れかを設定し、「×」を付けた国籍のユーザを対戦相手から除外することができる。希望条件としては「◎」「○」「△」「×」を設定することができる。希望条件とする場合は、以下の（式−４）により各国籍毎に本人が設定した値（０〜３）に重み付けと対戦サーバ１０が設定する係数をかけて相違度が算出される。
【００４５】
【数３】

【００４６】
「ルール」の項目については、複数のルール（Ａ式、Ｂ式など）のそれぞれに対して、絶対条件では図１５、図１６に示すように「○」か「×」かのどちらかを設定し、「×」を付けたルールを希望するユーザを除外することができる。希望条件としては、図１７に示すように「◎」「○」「△」「×」を設定することができる。希望条件とする場合は、以下の（式−５）により各ルール毎に本人が設定した値（０〜３）と候補者が付けた値とを加算し、その内の最小値に重み付けと対戦サーバ１０が設定する係数をかけて相違度が算出される。
【００４７】
【数４】

【００４８】
「ログアウト残り時間」については、対戦希望者が予めログアウトする時間を登録しておくことができる。絶対条件としての設定や重み付けはできないが、対戦待ちの時にログアウト時間が近づいてきたら優先的に紹介したり、ログアウト残り時間と対戦者候補の対戦時間を参考にしての紹介を行ったり、対戦中であっても対戦の終わり近くでありログアウト残り時間が充分に有る場合は自動的に対戦待ちリストに登録して次の対戦者を探すといったことができる。これにより時間の無駄なく対戦を行なうことができる。ログアウト残り時間に対する値は、以下の式−６により対戦サーバ１０が設定する係数のみをかけて算出される。
【００４９】
Ｄｌｏ＝（（ＬＯＴ−１２０）／１２０）＊Ｓｌｏ 式−６
ＬＯＴ：ログアウト残り時間、設定していないユーザは２４０分。２４０分以上の時は２４０分。
【００５０】
「最大待ち時間残り」については、対戦希望者が予め最大待てる時間を登録しておくもので、絶対条件としての設定や重み付けはできないが、最大待ち時間が近づいてきたユーザを優先的に紹介するものである。これにより、最大待ち時間が近づいてきたら自動的に条件を緩和して対戦候補者として選択されやすくすることができる。最大待ち時間残りに対する値は、以下の式−７により対戦サーバ１０が設定する係数のみをかけて算出される。
【００５１】
Ｄｍｚ＝（ＭＷＴ／６０）＊Ｓｍｚ 式−７
ＭＷＴ：最大待ち時間残り、設定していないユーザは６０分。６０分以上は６０分
「待ち時間」については、対戦希望者が登録や設定することも、絶対条件としての設定や重み付けもできないが、対戦サーバ１０が自動的に管理しており、待ち時間が長いユーザを優先的に紹介するものである。これにより、待ち時間の長いユーザの優先度を上げて対戦候補者として紹介するので、各ユーザが最短待ち時間で対戦できるようすることができる。待ち時間残りに対する値は、以下の式−８により対戦サーバ１０が設定する係数のみをかけて算出される。
【００５２】
Ｄｍｊ＝（ＡＷＴ／ＷＴ）＊Ｓｍｊ 式−８
ＡＷＴ：対戦待ちのユーザの平均待ち時間、ＷＴ：候補者の待ち時間
「対戦回数」については、対戦希望者が登録や設定することも、絶対条件としての設定や重み付けもできないが、対戦サーバ１０が自動的に管理しており、その日の対戦回数が少ないユーザほど優先的に紹介するものである。これにより、各ユーザに対して公平に対戦の機会を与えることができる。対戦回数に対する値は、以下の式−９により対戦サーバ１０が設定する係数のみをかけて算出される。
【００５３】
Ｄｔｓ＝（ＤＰＣ＋ＣＤＰ）＊Ｓｔｓ 式−９
ＤＰＣ：本人の今日の対戦数、ＣＤＰ：対戦候補の今日の対戦数
なお、「対戦回数」は１回のログインでの対戦数が少ないユーザの優先度が高くなるようにしても良い。
【００５４】
こうして、各対戦候補者について上述の各条件に対応して算出される値「Ｄｘｘ」のうちで絶対条件に指定されなかったものを加算した相違度を求め、閾値（希望条件の種類と数によって変化）を超えた（あるいは以下の）ユーザについては対戦候補者とし、ハンデを計算して候補者リストに登録する。
【００５５】
次に、前述した条件設定の内容を利用した対戦者紹介処理について、図８及び図９に示すフローチャートを参照しながら説明する。
まず、ＬＣＤ３８のキー入力部に設けられた「対戦者紹介」がユーザによって選択されると、対戦サーバ１０は、前述のようにして予め設定されている紹介要求を行ったユーザの条件設定の内容（この時紹介ユーザ数も）をデータベース１０ａから読みこむ（ステップＢ１，Ｂ２）。そして、その条件の中から「絶対条件」として指定されている条件と「２度と対戦したくない」を示す再対戦拒否指定に基づいて、「対局待ちリスト」の中から紹介対象外とするユーザを除く予備選択をおこなう（ステップＢ３）。次に、「対局待ちリスト」に残ったユーザについて、それぞれのユーザの対戦データなどを用いて希望条件を計算し、その希望条件の数値が予め設定された閾値を超えた人のみが登録された候補者リストを作成する（ステップＢ４）。
【００５６】
ここで、候補者数が表示希望ユーザ数（Ｎ）に満たない時は（ステップＢ５）、「現在対戦中で直ぐ終わりそうで、次対戦希望を登録しているユーザ」及び「現在対戦中でもうすぐ終わりそうで、ログアウト時間まで充分時間があるユーザ」を、各ユーザの対戦リストに登録された内容をもとにしてリストアップして（ステップＢ６）、リスト中の上位のユーザが準に絶対条件をもとに検索し（ステップＢ７）、上述の対戦待ちのユーザと同じように絶対条件と希望条件で検索して閾値を超えたら、待ち時間を予測し、ハンデを計算して候補者リストに追加する（ステップＢ８）。
【００５７】
これでも、１人のユーザも候補に上がらなかった時は（ステップＢ９）、対戦サーバ１０は、専用端末１６に対して「希望に合う対戦者がいません。希望を変更しますか？」といったメッセージを表示させるなどして条件変更を促す（ステップＢ１０）。このメッセージに対して専用端末１６のキー入力部に設けられた「はい」ボタンがユーザにより選択されると（ステップＢ１２）、対戦サーバ１０は、前述の条件設定画面（図１５〜図１７）を専用端末１６において表示させて、再度条件を変更してもらい再度候補者を検索する（ステップＢ１１）。また、専用端末１６のキー入力部に設けられた「いいえ」ボタンがユーザにより選択され条件を変更しない時は（ステップＢ１２）、対戦サーバ１０は、専用端末１６において「対戦待ちリストに登録しますか？」のメッセージを表示させて対戦待ちリストへの登録を促す（ステップＢ１３）。ここで「はい」ボタンがユーザにより選択され対戦待ちリストへの登録が要求されると（ステップＢ１４）、対戦サーバ１０は、このユーザを対戦待ちリストに登録して、他のユーザからの対戦要求に対して対戦相手として選択されるようにする（ステップＢ１５）。これにより専用端末１６ではメニューに戻る。
【００５８】
一方、条件設定の内容に応じて検索をした結果、候補者リストに候補者が登録されている場合には、対戦サーバ１０は、候補者リストの上位（相違度の小さい方）から表示希望ユーザ数（Ｎ）（満たない時は全員）を、例えば図１８または図１９に示すようにして表示させてユーザに対戦相手を選択してもらう（ステップＢ１６，Ｂ１７）。図１８に示す候補者紹介の画面は１人ごとに候補者を紹介する例であり、図１９は複数（図中では３人）ごとに候補者を紹介する例を示している。候補者紹介画面には、候補者の再紹介を要求するための「再紹介」ボタンと、各候補者ごとの対戦申し込みを要求するための「対戦申込」ボタンが設けられている。
【００５９】
ここで、「再紹介」ボタンがユーザによって押された場合（ステップＢ１８，Ｂ１９）、対戦サーバ１０は、現在表示中の候補者を候補者リストから削除すると共に（ステップＢ３０）、候補者リスト中の次の順位の候補者を表示させる（ステップＢ１６，Ｂ１７）。また、「取消」ボタンがユーザによって押された場合（ステップＢ２０）、対戦サーバ１０は、対戦者紹介処理を終了し、専用端末１６をメニュー画面表示の状態に戻す。
【００６０】
また、「対戦申込」ボタンがユーザによってが押された場合、対戦サーバ１０は、その「対戦申込」ボタンに対応する候補者が対戦中であったら（ステップＢ２１）、対戦中の候補者に対して対戦申し込みが他のユーザからあったことを通知すると共に対戦要求したユーザの情報を表示させ、次に対戦するかどうかを問い合わせる（ステップＢ２２）。ここで、対戦要求を受諾する応答が候補者の専用端末１６があった場合（ステップＢ２３）、対戦サーバ１０は、対戦希望者の専用端末１６において対戦要求が相手に受諾されたことを通知する「対戦ＯＫ」のメッセージを表示させて対戦予約として両者を対戦リスト（例えば、「状態」項目）に登録する（ステップＢ２４）。対戦要求を行ったユーザの専用端末１６ではメニュー表示の状態に戻り、対戦開始が可能となるまで待ち状態となる。そして対戦相手の対戦が終了したら、対戦サーバ１０は、予約していた対戦希望者に対戦開始を知らせて対戦を開始させる。
【００６１】
一方、候補者紹介画面からユーザによって選択された候補者が対戦中でない場合（ステップＢ２１）、対戦サーバ１０は、その候補者の専用端末１６に対して対戦を申し込みを通知する（ステップＢ２５）。ここで、対戦申し込みを受ける「ＯＫ」の応答があった場合（ステップＢ２６）、対戦サーバ１０は、両者の間での対戦を開始させる。また、対戦申し込みが断られた場合（ステップＢ２６）、あるいは対戦候補者が対戦中であって対戦申し込みを通知した結果、対戦を断る応答があった場合には（ステップＢ２３）、対戦サーバ１０は、対戦要求を行ったユーザの専用端末１６において、例えば「断られました」のメッセージを表示させ（ステップＢ２７）、選択された候補者との対戦ができないことを通知する。ここで、候補者リスト中に他の候補者が登録されている場合は（ステップＢ２８）、対戦サーバ１０は、断ってきた候補者を候補者リストから削除すると共に、前述と同様にして再度候補者を表示してユーザに選択してもらう（ステップＢ２９）。また、候補者リストに登録された候補者がなくなった場合は、対戦サーバ１０は、「希望に合う対戦者がいません。希望を変更しますか？」のメッセージを表示させ（ステップＢ１０）、前述と同様にして、条件変更するか、対戦待ちに登録するか、メニューに戻るかを選択してもらう。
【００６２】
このようにして、独自の段級位や相手の段級位の希望、対戦時間、ルールなどを絶対条件と希望条件に分けた条件設定の内容に応じて総合的に判断して候補者を選択し、対戦要求を行ってきたユーザの専用端末１６に通知して、図１８または図１９に示すようにして候補者紹介画面を表示させ、この画面中から任意に対戦相手を選択することができる。候補者紹介画面において紹介される対戦候補者は、条件設定の内容に該当する候補者のみ、すなわち対戦待ちの全員中から最適の相手を探して紹介するので、ユーザが希望する良い相手を容易に選択することができ楽しい対戦が可能となる。
【００６３】
また、過去の１戦当たりの時間、ログアウト時間、対戦回数などのデータから、現在対戦中のユーザでも終わりそうで、かつまた対戦しそうなユーザを対戦候補者に入れ、次の対戦希望者がいたらその旨を通知して対戦の可否を確認するので時間の無駄なく対戦できる。また、対戦中にこの対戦が終わった後も再度対戦することを登録して次の対戦者を探しておいて効率的に対戦を行なうことができる。
【００６４】
次に、前述した条件設定の内容を利用した対戦者一覧処理について、図１０及び図１１に示すフローチャートを参照しながら説明する。
まず、ＬＣＤ３８のキー入力部に設けられた「対戦者一覧」がユーザによって選択されると、対戦サーバ１０は、対戦希望本人の段級位、再対戦拒否リスト、絶対条件を、データベース１０ａ（ユーザデータ）あるいは対戦リストから読みこむ（ステップＣ１，Ｃ２，Ｃ３）。対戦サーバ１０は、これらと対戦待ちリストのユーザを比較し、再対戦拒否リストに登録されていないユーザで候補者リストを作成する（ステップＣ４）。また、候補者リストに登録された候補者のうち対戦要求を行っているユーザ本人を再対戦拒否に指定している候補者を削除し（ステップＣ５）、さらに絶対条件ではずれた候補者を削除する（ステップＣ６）。
【００６５】
この結果、候補者リスト中に候補者が登録されていない場合は（ステップＣ７）、対戦サーバ１０は、専用端末１６に対して「希望に合う対戦者がいません。希望を変更しますか？」といったメッセージを表示させるなどして条件変更を促す（ステップＣ８）。このメッセージに対して専用端末１６のキー入力部に設けられた「はい」ボタンがユーザにより選択されると（ステップＣ９）、対戦サーバ１０は、前述の条件設定画面（図１５〜図１７）を専用端末１６において表示させて、再度条件を変更してもらい再度候補者を検索する（ステップＣ１０）。また、専用端末１６のキー入力部に設けられた「いいえ」ボタンがユーザにより選択され条件を変更しない時は（ステップＣ９）、対戦サーバ１０は、専用端末１６において「対戦待ちリストに登録しますか？」のメッセージを表示させて対戦待ちリストへの登録を促す（ステップＣ１１）。ここで「はい」ボタンがユーザにより選択され対戦待ちリストへの登録が要求されると（ステップＣ１２）、対戦サーバ１０は、このユーザを対戦待ちリストに登録して、他のユーザからの対戦要求に対して対戦相手として選択されるようにする（ステップＣ１３）。これにより専用端末１６ではメニューに戻る。
【００６６】
一方、候補者リストに候補者が登録されている場合には（ステップＣ７）、対戦サーバ１０は、その候補者を段級位の近い順に並び替えた候補者リストを作成し（ステップＣ１４）、その順番を並びかえた候補リストを専用端末１６において表示させてユーザに対戦相手を選択してもらう（ステップＣ１５）。
【００６７】
図２０には、専用端末１６の表示画面中に表示される候補者一覧画面の一例を示している。候補者一覧画面では、候補者を選択するためのカーソルと（図２０では候補者「きくちゃん」の位置にある）、カーソルにより指定されている候補者に対して対戦申し込みを行なうための「対戦申込」ボタンと、対戦者一覧処理の中止を指示するための「取消」ボタンが設けられている。さらに、候補者リストに登録されている候補者が多数いるために、１画面中に全ての候補者を表示できない場合には「次頁」「前頁」ボタンを必要に応じて設け、候補者一覧表示の頁を進めたり戻したりして対戦者を選択できるようにする。
【００６８】
ここで、「取消」ボタンがユーザによって押された場合（ステップＣ１６，Ｃ１７）、対戦サーバ１０は、対戦者一覧処理を終了して、専用端末１６をメニュー表示の状態に戻す。「次頁」ボタンがユーザによって押された場合（ステップＣ１６，Ｃ１８）、対戦サーバ１０は、候補者リストの次頁に該当する候補者を候補者一覧画面において表示させてユーザに対戦相手を選択してもらう（ステップＣ１９）。「前頁」ボタンがユーザによって押された場合（ステップＣ１６，Ｃ２０）、対戦サーバ１０は、候補者リストの前頁（現在、最終頁を表示中であれば先頭頁）に該当する候補者を候補者一覧画面において表示させてユーザに対戦相手を選択してもらう（ステップＣ２１）。
【００６９】
また、対戦者がカーソルにより選択されて「対戦申込」ボタンが押された場合（ステップＣ１６）、対戦サーバ１０は、その対戦相手として選択された候補者に対して対戦申し込みが他のユーザからあったことを通知すると共に対戦要求したユーザの情報を表示させ、次に対戦するかどうかを問い合わせる（ステップＣ２２）。ここで、対戦要求を受諾する応答が候補者の専用端末１６があった場合（ステップＣ２３）、対戦サーバ１０は、対戦希望者の専用端末１６において対戦要求が相手に受諾されたことを通知すると共に、対戦相手とのハンデを計算しそれを表示して対戦に入る（ステップＣ２７）。
【００７０】
一方、対戦を断る応答があった場合には（ステップＣ２３）、対戦サーバ１０は、対戦要求を行ったユーザの専用端末１６において、例えば「断られました」のメッセージを表示させ（ステップＣ２４）、選択された候補者との対戦ができないことを通知する。ここで、候補者リスト中に他の候補者が登録されている場合は（ステップＣ２５）、対戦サーバ１０は、断ってきた候補者を候補者リストから削除すると共に、前述と同様にして再度候補者を表示してユーザに選択してもらう（ステップＣ２６）。また、候補者リストに登録された候補者がなくなった場合は、対戦サーバ１０は、「希望に合う対戦者がいません。希望を変更しますか？」のメッセージを表示させ（ステップＣ８）、前述と同様にして、条件変更するか、対戦待ちに登録するか、メニューに戻るかを選択してもらう。
【００７１】
このようにして、条件設定の内容に応じて候補者を選択し、対戦要求を行ってきたユーザの専用端末１６に通知して、図２０に示すようにして候補者一覧として表示させ、この画面中から任意に対戦相手を選択することができる。候補者一覧画面において紹介される対戦候補者は、条件設定の内容に該当する候補者のみが表示され、「次頁」「前頁」ボタンの操作により簡単に一覧画面を切り替えることができるので、候補者が多数存在するた場合でもユーザが希望する良い相手を容易に選択することができる。
【００７２】
以上のようにして、対戦者紹介処理、あるいは対戦者一覧処理によって対戦相手を選択し、対戦サーバ１０を通じて対戦が実行される。そして、対戦中または対戦終了直後には、対戦サーバ１０は、対戦をしている専用端末１６において「もう一戦」ボタンを設定させる。対戦サーバ１０は、この「もう一戦ボタン」がユーザによって押されると、対戦相手の専用端末１６に対して「続けてもう一戦しませんか？」のメッセージを表示させる。
【００７３】
このメッセージに対して専用端末１６のキー入力部に設けられた「はい」ボタンが対戦相手により選択され、対戦を受諾する応答があると、対戦サーバ１０は、対戦リストに両名の対戦を登録または対戦予約に登録し、それぞれのユーザに対する対戦終了予定時間（ログアウト残り時間）を１対戦分延長する。これによりユーザは、ボタンを押すだけで今のユーザと続けて対戦でき、手続きが簡略化されて操作が容易となる。また「いいえ」ボタンが対戦相手により選択された場合には、対戦サーバ１０は、その対戦をそのまま終了させる。なお、対戦をしている（していた）ユーザが予め次の対戦を予約している場合は、専用端末１６において「もう一戦」ボタンも「続けてもう一戦しませんか？」のメッセージも表示させないものとする。
【００７４】
こうして対戦が終わり勝敗が決まったら、対戦サーバ１０は、その都度、対戦結果に基づいて独自段級位更新処理を実行する。以下、図１２に示すフローチャートを参照しながら、独自段級位更新処理について説明する。図１２は、１人のユーザに対する独自段級位更新処理を示している。
【００７５】
まず、対戦サーバ１０は、今回の対戦の勝敗と前回の対戦の勝敗をもとにして、新しい詳段級位ＤＤＫｎを求めるための以下の式−１０において用いられる計数ＶＬを設定する。すなわち、前回と今回の対戦をともに勝った場合には（ステップＤ１，Ｄ２）、ＶＬ＝１．０に設定し（ステップＤ４）、今回は勝ったが前回で負けている場合には（ステップＤ１，Ｄ２）、ＶＬ＝０．５に設定し（ステップＤ３）、今回は負けたが前回で勝っている場合には（ステップＤ１，Ｄ５）、ＶＬ＝−１．５に設定し（ステップＤ６）、前回と今回の対戦をともに負けた場合には（ステップＤ１，Ｄ５）、ＶＬ＝−０．５に設定する（ステップＤ７）。また、前回の対戦から今回の対戦までの間隔（日数）ＤＩを７で割って週単位（整数値）としたＩＧＩを算出し（ステップＤ８）、この値ＩＧＩと計数ＶＬを用いて以下の式−１０に従って新しい詳段級位ＤＤＫｎを算出する（ステップＤ９）。
【００７６】
【数５】

【００７７】
すなわち、新しい詳段級位ＤＤＫｎは、自分の詳段級位の幅ＲＷを１０で割り、それに今回の対戦の勝敗と前回の対戦の勝敗で決まる係数ＶＬを掛け、それに前回の対戦から今回の対戦までの間隔（日数）ＤＩを７で割って週単位（整数値）としたＩＧＩで０．９５をべき乗したものをかけ、対戦前の詳段級位ＤＤＫｎ−１ に加算するのである。これにより対戦間隔が各１週間以内であれば、最短１０連勝すれば上位の段の詳段級位に到達させることができる。
【００７８】
そして、上位の段級位になって５戦してもそのランクから落ちない場合、すなわち現在の独自段級位が新しい詳段級位ＤＤＫｎの属する段級位に属さず（ステップＤ１０）、かつ過去４戦のそれぞれにおいて算出した詳段級位ＤＤＫｎ−１〜ＤＤＫｎ−４が新しい詳段級位ＤＤＫｎの属する段級位に属する場合であれば（ステップＤ１１〜Ｄ１４）、対戦サーバ１０は、独自段級位を新しい詳段級位ＤＤＫｎの属する段級位に昇格させる（ステップＤ１５）。
【００７９】
こうして独自段級位を更新した場合には、対戦サーバ１０は、外部団体が主催する段級位認定（基本的には独自段級位と同じ）の上位の段級に該当しているかを判別し、該当していれば外部団体の段級位認定試験の受験を勧めるメッセージ、例えば「あなたは○段になりました。○○の段級位認定試験を受験しますか？」をユーザの専用端末１６において表示させる（ステップＤ１６）。ここで、専用端末１６においてユーザにより「はい」ボタンが押された場合（ステップＤ１７）、対戦サーバ１０は、段級位認定試験の受験申し込みの手続に入り（ステップＤ１８）、一方、「いいえ」ボタンが押された場合には（ステップＤ１７）、そのままメッセージを消去させて次の処理に以降する（ステップＤ１９）。
【００８０】
こうして、詳段級位の更新に前回の勝敗と前回からの間隔を加味するので、現在の実力を反映した段級位認定ができ、また独自の段級位が昇格して充分に実力が安定したら、外部団体主催の段級位認定試験の受験を自動的に勧めるので、昇格のチャンスを逃がすことが少なくかつ合格率を向上させることができる。
【００８１】
また、対戦サーバ１０は、外部団体の段級位認定試験の結果や、懸賞問題に段級位認定試験の問題やそれ相当の問題をデータベース１０ａに登録しておき、独自段級位と外部団体が主催する段級位との間の整合を取る。図２１は、整合を取る前と取った後の、詳段級位と独自段級位（外部団体の段級位とほぼ同じ）の変化の関係を示したものである。
【００８２】
前述のように対戦サーバ１０は、各ユーザの過去の戦績、独自段級位、詳段級位、対戦月日などのデータを保持しているので、対戦するたびに更新された詳段級位−独自段級位で過去の独自段級位も計算し直して独自段級位を更新する。従って、ユーザは、絶えず現在の実力に近い段級位が得られる。さらに、外部団体の段級位認定試験の結果やその問題などを懸賞問題として、その解答結果等から独自段級位と外部団体の段級位との整合を取っているので、外部段級位を持つユーザとの対戦の時の実力やハンデの決め方などで不都合が起こることが無い。
【００８３】
次に、専用端末１６からの要求に応じて、対戦サーバ１０（コンテンツサーバ１０ｃ）に登録された棋譜データや問題集などの各種情報（コンテンツ）の検索を行なう場合について説明する。
【００８４】
はじめに、棋譜データなどを検索する場合について説明する。対戦サーバ１０は、専用端末１６からの要求に応じて、コンテンツサーバ１０ｃに登録された各種情報（コンテンツ）を提供することができる。対戦サーバ１０は、専用端末１６において例えば図２２に示すような情報検索用の画面を表示させ、この画面に対する指示に応じて該当する棋譜データなどの情報の検索を行なうことができる。情報検索用画面には、例えば「既に見た物」「未だ見ていない物」「全検索」のボタンが設けられており、対戦サーバ１０は、各ボタンに対する要求に応じた情報（コンテンツ）を検索して専用端末１６に提供する（なお、初めての検索時には、「既に見た物」「未だ見ていない物」ボタンは不要であるので表示されないものとする）。この時、対戦サーバ１０は、各ユーザに提供した情報、例えば何れの棋譜データを提供したかを全て記憶しておく。対戦サーバ１０は、専用端末１６からの２回目以降の検索要求において、情報検索用画面において「既に見た物」ボタンが押された場合には、過去に検索（提供）済みの情報のうち、新しい方（後に検索をした方）から順に表示させる。また、「未だ見ていない物」ボタンが押された場合には、過去に検索（提供）済みの情報を除外して検索を行って検索結果を表示させる。また「全検索」ボタンが押された場合には、過去の検索（提供）済みの有無に関係なく全ての情報を対象として検索を行って該当する情報を表示させる。
【００８５】
次に、問題集などを検索する場合について説明する。対戦サーバ１０は、専用端末１６から最初に問題集の検索要求を受けると、その要求元のユーザの独自段級位、嗜好（例えば、予めユーザデータのユーザ情報（図３（ａ）参照）に登録しておく）などをもとにして適した問題集を選択して表示させる。そして、２回目以降の検索要求に対しては、対戦サーバ１０は、図２３のように前回提供済みの問題集の続きの問題集から表示させる。図２３に示す例では、前回までに「中級問題集３」までが提供済みであるため、「中級問題集４」以降の問題集を選択できるように専用端末１６において問題集一覧を表示させている。また、前回の検索から間隔（期間）が空いていてユーザの段級位が極端に変化している時などは、対戦サーバ１０は、その実力に適したレベルの問題集から選択できるように検索一覧画面を表示させる。従って、ユーザは、必要としている問題集などを簡単かつ迅速に検索して取り込むことができる。
【００８６】
なお、前述した条件設定の説明において用いた計算式（図１３参照）は一例であって、同様の目的を持った数値を算出できれば他の計算式を用いることも可能である。
【００８７】
【発明の効果】
以上のように本発明によれば、サーバ装置は、対戦拒否設定手段によって指定された相手が対戦相手候補として選択されないようにして、最適の相手を探して紹介するので、ユーザが希望する良い相手を容易に選択することができ楽しい対戦が可能となる。
【図面の簡単な説明】
【図１】本発明の実施の形態に係わる通信対戦システムの構成を示すブロック図。
【図２】対戦サーバ１０の構成を示すブロック図。
【図３】対戦サーバ１０において管理されるデータの一例を示す図。
【図４】専用端末１６の外観構成を示す図。
【図５】専用端末１６の回路構成を示すブロック図。
【図６】専用端末１６が動作中のＬＣＤ３８によって表示される画面の一例を示す図。
【図７】専用端末１６における通信対戦時の概略動作について説明するためのフローチャート。
【図８】対戦者紹介処理を説明するためのフローチャート。
【図９】対戦者紹介処理を説明するためのフローチャート。
【図１０】対戦者一覧処理を説明するためのフローチャート。
【図１１】対戦者一覧処理を説明するためのフローチャート。
【図１２】独自段級位更新処理を説明するためのフローチャート。
【図１３】条件設定の内容を説明するための図。
【図１４】条件設定で用いられる重み付けの値の一例を示す図。
【図１５】条件設定画面の一例を示す図。
【図１６】条件設定画面の一例を示す図。
【図１７】条件設定画面の一例を示す図。
【図１８】候補者紹介画面の一例を示す図。
【図１９】候補者紹介画面の一例を示す図。
【図２０】専用端末１６の表示画面中に表示される候補者一覧画面の一例を示す図。
【図２１】詳段級位と独自段級位の整合前後の関係を示す図。
【図２２】情報検索用画面の一例を示す図。
【図２３】問題集検索用画面の一例を示す図。
【符号の説明】
１０…対戦サーバ
１０ａ…データベース
１０ｂ…対戦管理サーバ
１０ｃ…コンテンツサーバ
１０ｄ…ＧａｔｅＫｅｅｐｅｒ
１０ｅ…認証サーバ
１０ｆ…課金管理サーバ
１２…通信回線網
１４…インターネット
１６…専用端末
１８…パーソナルコンピュータ
１９…プロバイダ
２０…表示入力部
２２…電源ボタン
２４…コネクタ
３０…ＣＰＵ
３２…ＲＯＭ
３４…ＲＡＭ
３５…Ｆ−ＲＯＭ
３６…タッチパネル
３８…ＬＣＤ
４０…ＬＣＤドライバ
４２…通信インタフェース
４４…電源[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a communication battle system, a server device, and a storage medium storing a communication battle program for playing games such as Go and Shogi via a network.
[0002]
[Prior art]
A conventional system for playing games such as shogi and go over a network includes a terminal for display and start input, a server for connecting start users and exchanging start information, and a terminal and server. The telephone line for connection and a communication means such as a modem and a router are used.
[0003]
When a battle is performed in this system, a battle request is notified from the terminal to the server, so that a battle opponent is selected from a user who is registered for waiting for another game and a battle is started. Also, if there is no user registered for the battle, it is registered for the battle, and it is determined whether the battle is possible when another user newly requests a battle. Start.
[0004]
[Problems to be solved by the invention]
However, the conventional communication battle system may not be able to select the opponent of the ability intended by the user, or the hand determined based on the rank may be unfair. In addition, it was difficult to understand how much my ability was, and sometimes I missed the timing for taking the escalation test.
[0005]
In addition, when selecting an opponent from the list displayed, if there are many users who are registered waiting for a match, it is difficult to find a good opponent from the list, or if the terminal is small, the list is displayed. Even just looking, it took time and the operability sometimes worsened.
[0006]
The present invention has been made in view of the above problems, and an object of the present invention is to provide a communication battle system and a server device capable of selecting an opponent (or data) desired by a user by a simple operation. To do.
[0007]
[Means for Solving the Problems]
The present invention is a communication battle system composed of a plurality of terminals and a server device that provides a battle service that is connected to the terminals via communication means and plays a battle game between the terminals. And a server rejection setting unit for designating an opponent who does not wish to compete, and the server device selects an opponent candidate based on the condition set by the condition setting unit. It further comprises candidate selection means and selection prohibition means for preventing the opponent designated by the battle rejection setting means from being selected as a battle opponent candidate.
Further, the present invention provides a server device for providing a battle service for playing a battle game between a plurality of terminals connected via communication means, and receiving a condition related to the opponent of the battle game from each terminal A battle rejection receiving means for receiving designation of an opponent who does not wish to play from each terminal, an opponent candidate selecting means for selecting an opponent candidate based on the conditions received by the condition receiving means, and the battle rejection receiving means It is characterized by comprising selection prohibition means for preventing the opponent who does not wish to receive the battle from being selected as a battle opponent candidate.
[0008]
DETAILED DESCRIPTION OF THE INVENTION
Embodiments of the present invention will be described below with reference to the drawings.
FIG. 1 is a block diagram showing a configuration of a communication battle system according to an embodiment of the present invention. As shown in FIG. 1, a battle server 10 that provides various services (game battle, data provision, etc.) is connected to a dedicated terminal 16 and a personal computer (personal computer) 18 used by a user via a communication network 12. . The dedicated terminal 16 is configured, for example, as a terminal for playing a go game with an opponent via the communication network 12, and can play a game such as a go game via the battle server 10. Of course, it is possible to realize a function similar to that of the dedicated terminal 16 dedicated to the game by executing the game program by the personal computer 18 or the like. The battle server 10 can be connected to the dedicated terminal 16 and the personal computer 18 via the Internet 14. The dedicated terminal 16 and the personal computer 18 can connect to the Internet provider 19 through the communication line network 12 and connect to the Internet 14 through the provider 19 to access the battle server 10. Hereinafter, the case of playing a game of Go will be described as an example.
[0009]
FIG. 2 is a block diagram showing the configuration of the battle server 10. The battle server 10 provides various services to the dedicated terminal 16 or the personal computer 18 connected via the communication network 12 or the Internet 14. For example, the battle server 10 controls the game of the Go game between the terminals and plays the game. Provide services such as providing various information (win / loss record, stage, score).
[0010]
As shown in FIG. 2, the battle server 10 includes a database 10a, a battle management server 10b, a content server 10c, a GateKeeper 10d, an authentication server 10e, and a billing management server 10f. The database 10a registers data related to users who can receive services provided by the battle server 10, and includes, for example, user data as shown in FIG. For example, as shown in FIG. 3A, the user data includes a user code, name, detailed rank, opponent condition, opponent excluded (user code), user information (telephone number, e-mail address, address, etc.). It is included.
[0011]
The battle management server 10b is responsible for control of the battle (game of Go game). For example, FIG. 3B is used to control communication between the dedicated terminals 16 (PCs 18) during the battle and to control the battle. It holds a battle list as shown. In the battle list, for example, as shown in FIG. 3B, an access user indicating a user who is currently accessing, a user status (status) indicating whether the user being accessed is waiting for a battle or is playing a battle. , An opponent condition, a waiting time indicating an elapsed time since registration as a waiting for battle, a logout remaining time, and the like.
[0012]
The content server 10c registers various types of information (contents) to be provided to the user, and includes various types of information such as game record data, problem collections, and notices to the user.
[0013]
The GateKeeper 10d is a window for user access, and controls the access request from the user. The authentication server 10e executes an authentication process for identifying whether a user who has requested access is a user who can receive service provision from the battle server 10. The billing management server 10f manages billing information for each user who has received the service provided by the battle server 10.
Each server is configured by a computer that reads a program stored in various storage media and whose operation is controlled by the read program.
[0014]
FIG. 4 shows an external configuration of the dedicated terminal 16. The dedicated terminal 16 in the present embodiment is configured as a dedicated terminal for the Go game, and is configured by a computer that reads programs stored in various storage media and whose operations are controlled by the loaded programs. .
[0015]
As shown in FIG. 4, the dedicated terminal 16 is configured to be portable, and a display input unit 20 including an LCD (large monochrome liquid crystal) and a touch panel is provided on the upper surface of the casing. The display surface of the LCD and the data input surface of the touch panel are configured in a laminated and integrated manner, and objects displayed by the LCD (for example, a display pattern indicating a meteorite, an intersection position on display indicating a board surface, various buttons, etc.) are displayed. By directly instructing with a pen or the like, the corresponding coordinate data can be input. Further, a connector 24 for connecting to a communication network such as a modular jack is provided, so that it is possible to play against an opponent connected via the communication line network 12 by using a game service provided by the battle server 10. ing. In addition, the dedicated terminal 16 is provided with a power button 22 for turning on / off the power, a microphone, a speaker (not shown in FIG. 2), and the like.
[0016]
FIG. 5 is a block diagram showing a circuit configuration of the dedicated terminal 16. As shown in FIG. 5, the dedicated terminal 16 is provided with a CPU 30, ROM 32, RAM 34, F-ROM (flash ROM) 35, touch panel 36, LCD 38, LCD driver 40, communication interface 42, and power supply 44.
[0017]
The CPU 30 realizes various functions in accordance with various control programs and data stored in the ROM 32 or the F-ROM 35, and includes a function for executing a battle or communication such as a Go game.
The ROM 32 and the F-ROM 35 store various control programs and data executed by the CPU 30 and include various data in addition to a game program and a communication control program for realizing the Go game. . In addition to the ROM 32, RAM 34, and F-ROM 35, the dedicated terminal 16 can also be provided with a magnetic or optical storage medium that stores programs, data, or the like, or a storage medium that includes a semiconductor memory. The storage medium is fixedly provided in the storage device or is detachably mounted. The program, data, etc. stored in the storage medium may be received and stored from other devices connected via a communication line, etc. A storage device having a storage medium may be provided on the device side, and a program and data stored in the storage medium may be used via a communication line.
[0018]
The RAM 34 is a memory for temporarily storing various data handled in various processes executed by the CPU 30.
[0019]
The touch panel 36 is used for designating a position where a button for defining the operation of the apparatus and a stone during the execution of the go game should be placed.
The LCD 38 displays various kinds of information necessary for playing the Go game, a board display representing the board face of the Go board, a hook display for displaying the number of hooks for each of black stone and white stone, black numbers, white numbers A plurality of buttons for inputting a time display for displaying time and an instruction for defining an operation are provided (details are shown in FIG. 6). In addition, a segment pattern suitable for a game pattern display of the Go game is provided for the area of the LCD 38 where the board is displayed. Further, when using the mail order service provided by the battle server 10, various information related to the mail order is displayed.
[0020]
As described above, the touch panel 36 and the LCD 38 are configured in a laminated and integrated manner to form the display input unit 12, and the target object displayed on the LCD 38 is directly indicated by a pen or the like. Coordinate data can be input. The LCD driver 40 displays and drives the LCD 38 under the control of the CPU 30.
The communication interface 42 is an interface that manages control for performing communication via the communication line network 12.
The power supply 44 supplies power for operating each unit constituting the dedicated terminal 16 so that the dedicated terminal 16 can be carried to an arbitrary place without receiving external power supply.
[0021]
FIG. 6 shows an example of a screen displayed by the LCD 38 in which the dedicated terminal 16 is operating. As shown in FIG. 6, as information necessary for playing the Go game, a board surface display section representing the board surface of the board, a hook display section for displaying the number of hooks for each of black stone and white stone, black numbers, white numbers There is provided a time display unit for displaying the personal time and a key input unit including a plurality of buttons for inputting an instruction for defining an operation.
[0022]
The key input unit is provided with a key for inputting an instruction from the user according to the situation. That is, the LCD 38 displays a button in a predetermined area, and when an operation (touch input) is performed on each area, processing corresponding to the button is set to be executed. Designation of the position where the stone is placed on the board surface display indicating the start and key input are performed by touching the detection surface of the touch panel 36 integrated with the display screen of the LCD 38 with a pen-shaped indicator bar or fingertip. When it is detected by the touch panel 36 that a touch input has been made, processing corresponding to the touched position is executed. For example, a “connection” button for instructing a line connection with the dedicated terminal 16 or the personal computer 18 of the opponent via the communication line network 12 or the Internet 14, and “communication battle” for notifying the server device 30 of the competition request. If a button is provided and the “competitive battle” button is pressed, an “opponent introduction” button for requesting introduction of the opponent or “list of opponents” for requesting display of a list of opponents that can be played. A button is displayed. In addition, when the battle is started, various buttons used for proceeding with the battle, for example, cursor keys indicating the vertical and horizontal directions, a “start” button for instructing the start of the black number or the white number, A “pass” button for instructing a path, a “termination” button for instructing termination, a “pause” button for instructing interruption of the game, and the like are provided as necessary.
[0023]
Next, the operation of the communication battle system in the present embodiment will be described.
First, an outline of a schematic operation in the dedicated terminal 16 will be described. The user operates the dedicated terminal 16 by touching the touch panel 36. The CPU 30 of the dedicated terminal 16 drives the process according to a program stored in the ROM 32 or the F-ROM 35 in response to an operation on the touch panel 36 and reception of a start information command of the opponent from the communication interface 42.
[0024]
When detecting an event that a “connect” button provided in the key input unit is touched, the CPU 30 dials up the battle server 10 from the communication interface 42 to establish a data link. When detecting the event that the area on the grid surface is touched, the CPU 30 calculates the start coordinates from the touched point, displays its own stone at the corresponding point on the LCD 38, and sets the start coordinates by the start information command. It transmits to the battle server 10 through the communication interface 42. When another function button is touched, the CPU 30 transmits a corresponding command to the battle server 10. On the other hand, when an event for receiving a start information command is generated by the communication interface 42, the CPU 30 acquires the opponent's start coordinates from the start information command, and displays the opponent's stone at a corresponding point on the LCD 38.
[0025]
Next, the operation at the time of a communication battle in the dedicated terminal 16 will be described with reference to the flowchart shown in FIG.
First, when the dedicated terminal 16 is connected to the battle server 10, as shown in FIG. 6, the “communication battle” button is set in the key input unit of the LCD 38. When the “communication battle” button is pressed by the user, the dedicated terminal 16 notifies the battle server 10 of the battle request, and sets the “player introduction” button and the “player list” button in the key input unit. (Step A1). Here, the user who wants to play the battle introduces the opponent by the battle server 10, and selects the opponent from the list of other users who are currently making a battle request to the battle server 10. The opponent can be selected by any of the methods of the “list of opponents” to be selected (step A2).
[0026]
When the “player introduction” button or the “player list” button is pressed, the dedicated terminal 16 notifies the battle server 10 of a request corresponding to each button, and the player introduction process (FIGS. 8 and 9). The opponent list is determined by executing the opponent list process (shown in the flowcharts of FIGS. 10 and 11) (shown in the flowchart) (steps A3 and A4). Details of each process will be described later.
[0027]
When the opponent is determined, the “handicap” (hand) is determined based on the “unique rank” (representing the user's ability to the battle game reflecting the battle result) determined by the unique rank update process described later. It is calculated and notified from the battle server 10. Here, the handicap is calculated based on a detailed rank (described later) representing the details of the “unique rank” in the battle server 10. The dedicated terminal 16 displays “handicap” notified from the battle server 10 to allow the user to confirm. The “handicap” (hand) can be changed by an agreement between the users performing the battle. In this way, when the opponent is determined, the battle server 10 presents the initial handicap calculated based on the detailed rank, and both are confirmed, so a match that matches the ability can be made and an inappropriate handicap is added This makes it difficult for troubles between players to occur.
[0028]
Thus, after the battle preparation is completed, the dedicated terminal 16 executes a battle with the opponent through the battle server 10 in accordance with an instruction from the user (step A5).
[0029]
Then, when winning or losing of the match is determined, the unique rank update process (shown in the flowchart of FIG. 12) is executed in the battle server 10 based on the “unique rank” and the handicap in the match. The dedicated terminal 16 receives and displays the result of the unique rank update process by the battle server 10 (step A6). When it is determined that the ability is equivalent to the upper rank by this unique rank update (step A7), a message recommending that an "advanced / upgraded certification test" is further displayed (step A8).
[0030]
Next, processing in the battle server 10 corresponding to processing in the dedicated terminal 16 shown in FIG. 7 will be described with reference to flowcharts shown in FIGS. 8 and 9 are flowcharts for explaining the competitor introduction process, FIGS. 10 and 11 are flowcharts for explaining the opponent list process, and FIG. 12 is for explaining the unique rank update process. It is a flowchart.
[0031]
First, before describing the details of each process, the condition setting performed to determine the opponent will be described. When the battle server 10 (match management server 10b) receives a battle request from the dedicated terminal 16 and the personal computer 18, it registers the “status” of the battle list shown in FIG. 3B as “waiting”. Hereinafter, a list (not shown) for only access users whose “state” is “waiting” will be described as a “match waiting list”. In the opponent introduction process and the opponent list process, based on the content set in the condition setting, a user as an opponent who matches the user's wish is extracted from the competition waiting list and introduced, or a plurality of opponents The list is displayed to the user for selection. Therefore, the process for setting conditions is executed in advance for each user (dedicated terminal 16, personal computer 18), and the contents of the condition settings are registered in the battle server 10.
[0032]
The detailed contents of the condition setting will be described below. In the communication battle system according to the present embodiment, the contents of the condition setting include the nine conditions “rank”, “match time”, “match frequency”, “nationality”, “rule”, “logout remaining time”, “maximum” shown in FIG. There are "waiting time remaining", "waiting time", and "number of battles". For “individual rank”, “matching time”, “matching frequency”, “nationality”, and “rule”, set absolute conditions that strictly follow the setting contents and desired conditions that allow fluctuations within a specified range based on the setting contents. Can do. Further, it is possible to further set a replay refusal designation indicating that the user is “a user who does not want to do it again”. The opponent designated to refuse rematch is registered in the item of battle exclusion in the user data. The battle server 10 introduces the opponent by comprehensively judging the conditions of the nine items and the replay refusal designation. For “desired conditions”, by setting a weight, a calculation based on a predetermined calculation formula (see FIG. 13) prepared for each item is executed to determine the target range. As the weighting values, as shown in FIG. 14, by assigning arbitrary weights from “absolute”, “important”, “normal”, “light”, and “unquestioned”, the corresponding weighting values are set.
[0033]
The items “waiting time” and “number of battles” are managed in the battle server 10 and the user cannot set conditions. The “logout remaining time” and “maximum waiting time remaining” cannot be set directly by the user, but the scheduled time can be set in advance as the “logout scheduled time”, and the “maximum waiting time” is also set in advance. User can set.
[0034]
The conditions for each item will be described below.
First, the replay refusal designation indicating “a user who does not want to play again” can be set when the user thinks that “the user does not want to play again with this user” after a battle. After setting the replay refusal designation, in any of the “player introduction” and “player list”, the player will not be a target and will not play. On the other hand, when the user who is set to reject the rematch attempts to select an opponent from the “Introduction to Player” or “List of Players”, the user who has set the replay rejection is introduced or displayed. It will not be done. However, the setting can be canceled. In this way, it is possible to set the re-attack refusal designation as an absolute condition, so that it will not be introduced from the competition candidate until the setting is canceled for a specific opponent, and the opponent with this setting will also be You can prevent the application of.
[0035]
FIGS. 15 to 17 show the dedicated terminal 16 (or the conditions) for the conditions of five items “dan rank”, “match time”, “match frequency”, “nationality”, and “rule” that can set absolute conditions and desired conditions. An example of a screen for setting conditions in the personal computer 18) is shown. The content specified on the condition setting screen is notified to the battle server 10 and registered as the condition setting content for this user.
[0036]
The operation on the condition setting screen is simple. For the part where the setting contents of each condition are displayed, for example, the item “1. By designating (knocking) the “first stage” portion for setting the stage rank, the designated position is detected based on the coordinate data input from the touch panel 36, and the setting value corresponding to this designated position is set. It is changed in the preset order. For example, in the initial setting for the weight of the item “1. rank”, “unquestioned” is set, and if this part is specified, it changes to “disregard”. Change to “important”. If you give another instruction here, it will be “absolute”, and if you give more instructions, it will return to “unquestioned”. Thereby, arbitrary contents can be set only by performing a pointing operation in the display input unit 20. Regarding the setting for the other condition items, by specifying the setting content portion, “first stage”, “second stage”, “20th class”, “90”, “100”, “180”, “10”, etc., respectively. , "Within", "more than", "1 month", "1 week", "2 weeks" ..., "O", "X", "◎", "O", "△", "X" . When the “end setting” button is pressed, it is assumed that the setting for each condition item has been completed in accordance with an instruction from the user, and the content of the setting condition is sent to the battle server 10, and the “opponent condition” in the battle list (FIG. 3B).
[0037]
The item “stage rank” can be set in the range of 10 to 20 grades. In FIG. 15 to FIG. 17, the “unique rank” is simply displayed as “first rank”, “third rank”, “fourth rank”, but the individual strength (ability) is set to 0 in the system, for example. It is managed as a “detailed rank” indicated by values up to 3000. In other words, the stage level is managed by a double structure of a unique level and a detailed detailed level. In the database 10a, as shown in FIG. 3A, data "detailed rank" indicating the strength of each user is registered in the user data.
[0038]
In the opponent selection process, if the setting of the weight of the rank item is “absolute” indicating the absolute condition as shown in FIG. 16 and the range is specified as “within 3rd to 4th class” as the condition, Only people with that range of strength can be selected. When “important”, “normal”, “disregard”, and “unquestioned” are set for the weight setting, the degree of difference in the rank is determined by the following (formula-1) multiplied by the weight value (Wdk) shown in FIG. Is calculated.
[0039]
[Expression 1]

[0040]
Sdk is a coefficient preset by the battle server 10. The same applies to Sxx (xx represents a character corresponding to each item) in each formula described later. The battle server 10 realizes the optimum player introduction by changing the value of Sdk (Sxx) according to the situation.
[0041]
With respect to the item “matching time”, a desired match time of “I want to play one match within this time” can be set in advance in increments of 10 minutes from “30 minutes to 180 minutes”. The battle server 10 (database 10a) stores past battle data of each user, and the normal battle time (mode value) of the battle candidate is obtained from this battle data. When set to “within” or “above”, it is processed as an absolute condition, and when set to “rank”, a weight value (Wtj) is multiplied as a desired condition based on the battle time (mode value) (formula − The difference degree of the desired battle time is calculated by 2).
[0042]
[Expression 2]

[0043]
The item “Competition Frequency” is for avoiding or emphasizing the tendency that users with similar conditions are likely to be selected as opponents. Alternatively, a period can be set in “one month”, and “◯” or “X” indicating whether or not a battle is possible for the period can be set. That is, by making it possible to set the “competition frequency”, it is possible to increase or decrease the priority selected as a battle candidate for a specific opponent. By lowering the priority, it is possible to prevent the battle from becoming familiar with only a specific opponent and to help improve the ability. By raising the priority, it is possible to increase the number of friends and deepen friendship. For example, as shown in FIG. 16, if “×” is set within “one week” as an absolute condition, users who have played in one week are excluded from the battle candidates, and “O” within “one month” is selected. If set, only users who have played in one month remain as battle candidates. When the desired condition is set, the degree of difference is calculated based on the number of battles in the past 30 days from the battle history according to the following (formula-3), as shown in FIGS.
[0044]
Dfr = (MCPC / MPC) * Sfr * Wfr Formula-3
MCPC: Number of matches with the candidate for the past 30 days, MPC: Number of matches with the person for the past 30 days
With regard to the item of “nationality”, either “O” or “X” can be set as an absolute condition, and a user with a nationality with “X” can be excluded from the opponent. As desired conditions, “◎”, “◯”, “Δ”, and “×” can be set. In the case of the desired condition, the degree of difference is calculated by multiplying the value (0-3) set by the principal for each nationality by the weight and the coefficient set by the battle server 10 according to the following (Formula-4).
[0045]
[Equation 3]

[0046]
For the “Rule” item, either “O” or “X” is set for each of a plurality of rules (A formula, B formula, etc.) as shown in FIGS. Thus, it is possible to exclude a user who desires a rule with “x”. As desired conditions, “◎”, “◯”, “Δ”, and “×” can be set as shown in FIG. In the case of the desired condition, the value (0-3) set by the principal for each rule and the value assigned by the candidate are added for each rule by the following (Formula-5), and the minimum value is weighted and played. The degree of difference is calculated by multiplying the coefficient set by the server 10.
[0047]
[Expression 4]

[0048]
With respect to the “logout remaining time”, the time for the player who wants to compete to log out can be registered in advance. Although it cannot be set or weighted as an absolute condition, it will be introduced preferentially when the logout time approaches when waiting for a match, or it will be introduced with reference to the remaining logout time and the battle time of the opponent candidate, However, if it is near the end of the match and there is enough time remaining for logout, it can be automatically registered in the match waiting list to search for the next player. As a result, the battle can be performed without wasting time. The value for the remaining logout time is calculated by multiplying only the coefficient set by the battle server 10 according to the following expression-6.
[0049]
Dlo = ((LOT−120) / 120) * Slo formula−6
LOT: Logout remaining time, 240 minutes for unset users. 240 minutes for more than 240 minutes.
[0050]
“Maximum waiting time remaining” is a pre-registered time that the applicant can wait for in advance, and cannot be set or weighted as an absolute condition, but users who are approaching the maximum waiting time will be preferentially introduced. Is. As a result, when the maximum waiting time approaches, the conditions can be automatically relaxed to facilitate selection as a battle candidate. The value for the remaining maximum waiting time is calculated by multiplying only the coefficient set by the battle server 10 according to the following expression-7.
[0051]
Dmz = (MWT / 60) * Smz Formula-7
MWT: Maximum waiting time remaining, 60 minutes for unset users. 60 minutes or more is 60 minutes
The “waiting time” cannot be set or weighted by an opponent who wants to play, nor can it be set or weighted as an absolute condition, but the fighting server 10 automatically manages and gives priority to users with long waiting times. It is something to introduce. Thereby, since the priority of the user with long waiting time is raised and introduced as a battle candidate, each user can be able to play with the shortest waiting time. The value for the remaining waiting time is calculated by multiplying only the coefficient set by the battle server 10 according to the following formula-8.
[0052]
Dmj = (AWT / WT) * Smj Formula-8
AWT: Average waiting time of users waiting for a match, WT: Waiting time of candidates
The “number of battles” cannot be registered or set by a battle candidate, nor can it be set or weighted as an absolute condition. Introductory. Thereby, the opportunity of a battle can be given to each user fairly. The value for the number of battles is calculated by multiplying only the coefficient set by the battle server 10 according to the following formula-9.
[0053]
Dts = (DPC + CDP) * Sts Formula-9
DPC: Number of matches played today, CDP: Number of matches played today
Note that the “number of battles” may be such that the priority of a user with a small number of battles in one login is higher.
[0054]
Thus, for each battle candidate, a difference is obtained by adding the values “Dxx” calculated corresponding to the above-mentioned conditions that are not designated as absolute conditions, and a threshold value (depending on the type and number of desired conditions). A user who exceeds (or is below) a change) is regarded as a battle candidate, and a handicap is calculated and registered in the candidate list.
[0055]
Next, the player introduction process using the above-described condition setting contents will be described with reference to the flowcharts shown in FIGS.
First, when the “player introduction” provided in the key input unit of the LCD 38 is selected by the user, the battle server 10 sets the condition setting conditions of the user who has made the introduction request set in advance as described above. (The number of introduced users at this time) is read from the database 10a (steps B1 and B2). Then, based on the conditions specified as “absolute conditions” from the conditions and the replay refusal specification indicating “I do not want to play again”, it is excluded from the referral list in the “game waiting list” Preliminary selection excluding the user is performed (step B3). Next, with respect to the users remaining in the “game waiting list”, the desired conditions are calculated using the battle data of each user, and only those whose numerical values of the desired conditions exceed a preset threshold are registered. A candidate list is created (step B4).
[0056]
Here, when the number of candidates is less than the number (N) of display desired users (step B5), “users who are likely to end immediately in the current battle and register the next battle request” and “currently in battle” “Users who are about to finish soon and have enough time to log out” are listed based on the contents registered in each user's battle list (step B6), and the top users in the list are absolutely Search based on conditions (step B7), and search for absolute conditions and desired conditions in the same way as the above-mentioned users waiting for a match. If the threshold is exceeded, the waiting time is predicted, the handicap is calculated, and the candidate list is calculated. (Step B8).
[0057]
Even when one user does not rise as a candidate (step B9), the battle server 10 asks the dedicated terminal 16 that “there is no opponent who wants. Do you want to change your wish?” A condition change is prompted by displaying a message (step B10). When the user selects the “Yes” button provided in the key input section of the dedicated terminal 16 in response to this message (step B12), the battle server 10 displays the above-described condition setting screen (FIGS. 15 to 17). The candidate is displayed on the dedicated terminal 16, and the candidate is changed again to search for candidates (step B11). In addition, when the “No” button provided in the key input section of the dedicated terminal 16 is selected by the user and the conditions are not changed (step B12), the battle server 10 “registers in the battle waiting list in the dedicated terminal 16”. The message “??” is displayed to prompt registration on the waiting list (step B13). Here, when the “Yes” button is selected by the user and registration to the competition waiting list is requested (step B14), the competition server 10 registers this user in the competition waiting list and requests competition from other users. Are selected as opponents (step B15). As a result, the dedicated terminal 16 returns to the menu.
[0058]
On the other hand, if the candidate is registered in the candidate list as a result of the search according to the content of the condition setting, the battle server 10 displays the user who wants to display from the top of the candidate list (the one with the smaller difference). The number (N) (all members when not satisfied) is displayed as shown in FIG. 18 or 19, for example, and the user selects an opponent (steps B16 and B17). The candidate introduction screen shown in FIG. 18 is an example of introducing a candidate for each person, and FIG. 19 shows an example of introducing candidates for every plurality (three persons in the figure). The candidate introduction screen is provided with a “re-introduction” button for requesting re-introduction of the candidate and a “match application” button for requesting a battle application for each candidate.
[0059]
Here, when the “re-introduction” button is pressed by the user (steps B18 and B19), the battle server 10 deletes the currently displayed candidate from the candidate list (step B30) and also in the candidate list. The candidates in the next rank are displayed (steps B16 and B17). When the “cancel” button is pressed by the user (step B20), the battle server 10 ends the player introduction process and returns the dedicated terminal 16 to the menu screen display state.
[0060]
In addition, when the user presses the “match application” button, the battle server 10 determines that the candidate corresponding to the “match application” button is in a battle (step B21), The user is notified that a match application has been received from another user, and information on the user who requested the battle is displayed, and an inquiry is made as to whether or not the battle will be played next (step B22). Here, when there is a response for accepting the battle request from the candidate's dedicated terminal 16 (step B23), the battle server 10 notifies the opponent that the battle request has been accepted by the opponent's dedicated terminal 16. A “match OK” message is displayed and both are registered in the match list (for example, “state” item) as a match reservation (step B24). The dedicated terminal 16 of the user who has made the battle request returns to the menu display state and waits until the battle can be started. When the battle of the opponent is completed, the battle server 10 notifies the reserved battle applicant that the battle has started and starts the battle.
[0061]
On the other hand, when the candidate selected by the user from the candidate introduction screen is not in a battle (step B21), the battle server 10 notifies the candidate's dedicated terminal 16 of the application for the battle (step B25). Here, when there is a response of “OK” for receiving a battle application (step B26), the battle server 10 starts a battle between the two. When the match application is refused (step B26), or when the match candidate is in a match and notified the match application, there is a response to decline the match (step B23). For example, a message “declined” is displayed on the dedicated terminal 16 of the user who has made the battle request (step B27) to notify that the battle with the selected candidate is not possible. Here, when another candidate is registered in the candidate list (step B28), the battle server 10 deletes the rejected candidate from the candidate list, and repeats the candidate in the same manner as described above. The person is displayed and the user selects it (step B29). In addition, when there are no candidates registered in the candidate list, the battle server 10 displays a message “There is no competitor who matches the hope. Do you want to change your wish?” (Step B10), In the same manner as described above, the user selects whether to change the condition, register for waiting for a match, or return to the menu.
[0062]
In this way, candidates are selected by comprehensively judging their own rank and opponent's rank preference, competition time, rules, etc. according to the contents of condition settings divided into absolute conditions and desired conditions Then, the dedicated terminal 16 of the user who has made the battle request is notified, and the candidate introduction screen is displayed as shown in FIG. 18 or 19, and the opponent can be arbitrarily selected from this screen. . The match candidates introduced on the candidate introduction screen are searched only for candidates that meet the conditions set, that is, the best match from all the players waiting for the match. You can choose and have fun matches.
[0063]
Also, based on data such as past time per battle, logout time, number of battles, etc., if a user who is likely to finish and who is likely to battle again is entered as a battle candidate and there is a next battle candidate Notifying that fact and confirming whether or not the battle is possible, it is possible to battle without wasting time. In addition, it is possible to register the battle again after the battle is over during the battle, search for the next player, and perform the battle efficiently.
[0064]
Next, an opponent list process using the above-described condition setting contents will be described with reference to the flowcharts shown in FIGS.
First, when the “competitor list” provided in the key input unit of the LCD 38 is selected by the user, the battle server 10 stores the database 10a (user Data) or the competition list (steps C1, C2, C3). The battle server 10 compares these with the users in the battle waiting list, and creates a candidate list with users who are not registered in the replay refusal list (step C4). Moreover, the candidate who designated the user who has requested the battle as the replay refusal from the candidates registered in the candidate list is deleted (step C5), and candidates who are not in absolute condition are deleted. (Step C6).
[0065]
As a result, when the candidate is not registered in the candidate list (step C7), the battle server 10 asks the dedicated terminal 16 that “there is no opponent who matches the hope. Do you want to change your wish? The message is prompted to change the condition (step C8). When the user selects the “Yes” button provided in the key input unit of the dedicated terminal 16 in response to this message (step C9), the battle server 10 displays the above-described condition setting screen (FIGS. 15 to 17). The candidate is displayed on the dedicated terminal 16, and the candidate is changed again, and the candidate is searched again (step C10). In addition, when the “No” button provided in the key input section of the dedicated terminal 16 is selected by the user and the conditions are not changed (step C9), the battle server 10 “registers in the battle waiting list in the dedicated terminal 16”. The message “??” is displayed to prompt registration on the waiting list (step C11). Here, when the “Yes” button is selected by the user and registration to the competition waiting list is requested (step C12), the competition server 10 registers this user in the competition waiting list and requests competition from other users. Are selected as opponents (step C13). As a result, the dedicated terminal 16 returns to the menu.
[0066]
On the other hand, when candidates are registered in the candidate list (step C7), the battle server 10 creates a candidate list in which the candidates are rearranged in order of rank (step C14). A candidate list in which the order is rearranged is displayed on the dedicated terminal 16 and the user selects an opponent (step C15).
[0067]
FIG. 20 shows an example of a candidate list screen displayed on the display screen of the dedicated terminal 16. On the candidate list screen, a cursor for selecting a candidate (in the position of the candidate “Kiku-chan” in FIG. 20), and a “match” for applying for a match against the candidate designated by the cursor. An “apply” button and a “cancel” button for instructing to cancel the opponent list process are provided. In addition, if there are many candidates registered in the candidate list and not all candidates can be displayed on one screen, the “next page” and “previous page” buttons are provided as necessary. Allows you to select an opponent by moving forward or backward through the list view.
[0068]
Here, when the “cancel” button is pressed by the user (steps C16 and C17), the battle server 10 ends the battle list process and returns the dedicated terminal 16 to the menu display state. When the “next page” button is pressed by the user (steps C16 and C18), the battle server 10 displays candidates corresponding to the next page of the candidate list on the candidate list screen and selects the opponent by the user. (Step C19). When the “Previous page” button is pressed by the user (steps C16 and C20), the battle server 10 selects a candidate corresponding to the previous page of the candidate list (the first page if the last page is currently displayed). It is displayed on the candidate list screen and the user selects an opponent (step C21).
[0069]
Further, when the opponent is selected by the cursor and the “match application” button is pressed (step C16), the battle server 10 applies a match application from another user to the candidate selected as the opponent. In addition, the information of the user who requested the battle is displayed, and an inquiry is made as to whether or not to battle next (step C22). Here, when there is a response for accepting the battle request from the candidate's dedicated terminal 16 (step C23), the battle server 10 notifies the opponent that the battle request has been accepted by the opponent's dedicated terminal 16. At the same time, the handicap with the opponent is calculated and displayed to enter the battle (step C27).
[0070]
On the other hand, when there is a response to decline the battle (step C23), the battle server 10 displays, for example, a message “I was declined” on the dedicated terminal 16 of the user who made the battle request (step C24). , Notify that the selected candidate cannot be played. Here, when another candidate is registered in the candidate list (step C25), the battle server 10 deletes the rejected candidate from the candidate list and repeats the candidate in the same manner as described above. The user is displayed and selected by the user (step C26). In addition, when there are no candidates registered in the candidate list, the battle server 10 displays a message “There is no competitor who matches the hope. Do you want to change your wish?” (Step C8), In the same manner as described above, the user selects whether to change the condition, register for waiting for a match, or return to the menu.
[0071]
In this way, a candidate is selected according to the contents of the condition setting, notified to the dedicated terminal 16 of the user who has made the battle request, and displayed as a candidate list as shown in FIG. You can select your opponent from the inside. Only the candidates that match the condition settings are displayed on the candidate list screen, and the list screen can be easily switched by operating the “next page” and “previous page” buttons. Even when there are a large number of candidates, a good partner desired by the user can be easily selected.
[0072]
As described above, the opponent is selected by the opponent introduction process or the opponent list process, and the battle is executed through the battle server 10. Then, during the battle or immediately after the battle ends, the battle server 10 sets the “another battle” button on the dedicated terminal 16 that is playing the battle. When the “other battle button” is pressed by the user, the battle server 10 displays a message “Would you like to continue another battle?” On the dedicated terminal 16 of the opponent.
[0073]
In response to this message, when the “Yes” button provided in the key input section of the dedicated terminal 16 is selected by the opponent and there is a response to accept the battle, the battle server 10 registers the battle of both names in the battle list. Alternatively, it is registered in a battle reservation, and the battle end scheduled time (logout remaining time) for each user is extended by one battle. As a result, the user can continue to play against the current user just by pressing a button, the procedure is simplified, and the operation becomes easy. When the “No” button is selected by the opponent, the battle server 10 ends the battle as it is. Note that if the user who is (has) played in advance reserves the next match in advance, the message “Would you like to continue again?” Is displayed on the dedicated terminal 16 as well. Is also not displayed.
[0074]
In this way, when the battle is over and winning or losing is determined, the battle server 10 executes the unique rank updating process based on the battle result each time. Hereinafter, the unique rank update process will be described with reference to the flowchart shown in FIG. FIG. 12 shows the unique rank update process for one user.
[0075]
First, the battle server 10 sets a count VL used in the following formula-10 for obtaining a new detailed rank DDKn based on the win / loss of the current battle and the win / loss of the previous battle. That is, when both the previous and current battles are won (steps D1 and D2), VL = 1.0 is set (step D4), and when this time is won but lost in the previous time (step D1) , D2), and set VL = 0.5 (step D3), and when losing this time but winning the previous time (steps D1 and D5), set VL = −1.5 (step D6). When both the previous and current battles are lost (steps D1 and D5), VL is set to −0.5 (step D7). Also, the IGI is calculated by dividing the interval (days) DI from the previous match to the current match by 7 (week D) and using the value IGI and the count VL as follows: A new detailed rank DDKn is calculated according to -10 (step D9).
[0076]
[Equation 5]

[0077]
That is, the new detailed rank DDKn divides the width RW of his detailed rank by 10 and multiplies it by the coefficient VL determined by the win / loss of the current match and the win / loss of the previous match, The interval (number of days) DI until the match is divided by 7 and multiplied by a power of 0.95 in IGI in units of weeks (integer value) and added to the detailed level DDKn-1 before the match. As a result, if the battle interval is within one week, it is possible to reach the detailed level of the upper level if it wins at least 10 consecutive wins.
[0078]
And, if it becomes a higher rank and does not fall from that rank even after 5 battles, that is, the current unique rank does not belong to the rank to which the new detailed rank DDKn belongs (step D10), and If the detailed level DDKn-1 to DDKn-4 calculated in each of the past four battles belong to the level to which the new detailed level DDKn belongs (steps D11 to D14), the battle server 10 is unique. The rank is promoted to the rank to which the new detailed rank DDKn belongs (step D15).
[0079]
When the original rank is updated in this way, the battle server 10 determines whether it corresponds to a higher rank of the rank recognition (basically the same as the unique rank) sponsored by an external organization. If applicable, a message recommending that you take the level certification examination of an external organization, for example, “You are now at the level. Do you want to take the level certification examination of XX?” It is displayed on the dedicated terminal 16 (step D16). Here, when the user presses the “Yes” button on the dedicated terminal 16 (Step D17), the battle server 10 enters the procedure for applying for the rank certification examination (Step D18), while “No”. When the button is pressed (step D17), the message is deleted as it is and the subsequent processing is performed (step D19).
[0080]
In this way, the update of the detailed rank level is taken into account the previous victory and defeat and the interval from the previous time, so the rank can be recognized reflecting the current ability, and the original rank is promoted and the ability is sufficiently stable If you do, you will automatically be encouraged to take the level certification test sponsored by an external organization, so you will not miss a chance to be promoted and you can improve your pass rate.
[0081]
In addition, the battle server 10 registers the results of the level certification test of the external group, the problem of the level certification test in the prize issue, and the equivalent problem in the database 10a. To match with the ranks sponsored by. FIG. 21 shows the relationship between the change of the detailed rank and the unique rank (substantially the same as the rank of an external organization) before and after matching.
[0082]
As described above, the battle server 10 holds data such as past battle results, unique ranks, detailed ranks, and battle dates of each user, so that the detailed ranks that are updated each time a battle is performed. -Recalculate the previous unique rank by recalculating the original unique rank. Therefore, the user can constantly obtain a rank that is close to the current ability. In addition, the results of the level certification test of external organizations and their problems are regarded as sweepstakes questions, and the results of the answers etc. are used to match the rankings of independent groups with those of external organizations. There will be no inconvenience in the ability to decide the handicap or the ability at the time of a battle with a user having.
[0083]
Next, a case where various information (contents) such as game record data and problem books registered in the battle server 10 (content server 10c) is searched in response to a request from the dedicated terminal 16 will be described.
[0084]
First, the case of searching game record data will be described. The battle server 10 can provide various information (contents) registered in the content server 10 c in response to a request from the dedicated terminal 16. The battle server 10 can display an information search screen as shown in FIG. 22, for example, on the dedicated terminal 16, and can search for information such as game record data in accordance with an instruction to this screen. The information search screen is provided with, for example, “already seen”, “not yet seen”, and “search all” buttons, and the battle server 10 provides information (contents) in response to a request for each button. It searches and provides it to the dedicated terminal 16 (note that, when searching for the first time, the “things that have already been seen” and “things that have not been seen” buttons are unnecessary and are not displayed). At this time, the battle server 10 stores all information provided to each user, for example, which game record data is provided. In the second and subsequent search requests from the dedicated terminal 16, the battle server 10, when the “already seen” button is pressed on the information search screen, Display from the newer one (the one who searched later) in order. In addition, when the “not yet viewed” button is pressed, the search is performed by excluding information that has been searched (provided) in the past, and the search result is displayed. When the “search all” button is pressed, a search is performed on all information regardless of whether or not past search (provided) has been performed, and the corresponding information is displayed.
[0085]
Next, a case where a collection of questions is searched will be described. When the battle server 10 first receives a search request for a collection of questions from the dedicated terminal 16, the request server user's original rank and preference (for example, user information in the user data (see FIG. 3A) in advance). Select a suitable question collection based on the Then, in response to the second and subsequent search requests, the battle server 10 displays the problem list that follows the previous problem list as shown in FIG. In the example shown in FIG. 23, since “intermediate question collection 3” has been provided by the previous time, a list of problem collections is displayed on the dedicated terminal 16 so that the problem collection after “intermediate question collection 4” can be selected. Yes. In addition, when the interval (period) is free from the previous search and the user's rank is extremely changing, the battle server 10 can search from the problem collection at a level suitable for the ability. Display the list screen. Therefore, the user can easily and quickly search for and import a problem collection that he / she needs.
[0086]
Note that the calculation formula (see FIG. 13) used in the description of the condition setting described above is an example, and other calculation formulas can be used as long as a numerical value having the same purpose can be calculated.
[0087]
【The invention's effect】
As described above, according to the present invention, The server device prevents the opponent specified by the battle rejection setting means from being selected as the opponent candidate, Since the optimum partner is searched for and introduced, a good partner desired by the user can be easily selected, and a fun battle is possible.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a configuration of a communication battle system according to an embodiment of the present invention.
FIG. 2 is a block diagram showing a configuration of a battle server 10;
FIG. 3 is a view showing an example of data managed in a battle server 10;
FIG. 4 is a diagram showing an external configuration of a dedicated terminal 16;
5 is a block diagram showing a circuit configuration of a dedicated terminal 16. FIG.
6 is a diagram showing an example of a screen displayed by the LCD 38 when the dedicated terminal 16 is operating. FIG.
FIG. 7 is a flowchart for explaining a schematic operation during a communication battle in the dedicated terminal 16;
FIG. 8 is a flowchart for explaining an opponent introduction process.
FIG. 9 is a flowchart for explaining an opponent introduction process.
FIG. 10 is a flowchart for explaining an opponent list process;
FIG. 11 is a flowchart for explaining an opponent list process;
FIG. 12 is a flowchart for explaining unique rank update processing;
FIG. 13 is a diagram for explaining the contents of condition setting.
FIG. 14 is a diagram showing an example of weighting values used in condition setting.
FIG. 15 is a diagram showing an example of a condition setting screen.
FIG. 16 is a diagram showing an example of a condition setting screen.
FIG. 17 is a diagram showing an example of a condition setting screen.
FIG. 18 is a diagram showing an example of a candidate introduction screen.
FIG. 19 is a diagram showing an example of a candidate introduction screen.
FIG. 20 is a diagram showing an example of a candidate list screen displayed on the display screen of the dedicated terminal 16;
FIG. 21 is a diagram showing a relationship before and after matching a detailed rank and a unique rank.
FIG. 22 is a diagram showing an example of an information search screen.
FIG. 23 is a diagram showing an example of a question collection search screen.
[Explanation of symbols]
10 ... Battle server
10a ... Database
10b ... Battle management server
10c ... Content server
10d… GateKeeper
10e ... Authentication server
10f ... Billing management server
12. Communication network
14 ... Internet
16. Dedicated terminal
18 ... Personal computer
19 ... provider
20 ... Display input section
22 ... Power button
24 ... Connector
30 ... CPU
32 ... ROM
34 ... RAM
35 ... F-ROM
36 ... Touch panel
38 ... LCD
40 ... LCD driver
42. Communication interface
44 ... Power supply

Claims (5)

A communication battle system composed of a plurality of terminals and a server device that provides a battle service connected to the terminals via the communication means and performs a battle game between the terminals,
The terminal
Condition setting means for inputting the conditions of the opponent,
A battle refusal setting means for designating opponents who do not wish to play,
The server device
An opponent candidate selection means for selecting an opponent candidate based on the condition set by the condition setting means;
A communication battle system, comprising: a selection prohibition unit that prevents an opponent designated by the battle rejection setting unit from being selected as a battle opponent candidate.   2. The communication according to claim 1, wherein the selection prohibiting unit is configured to prevent an opponent whose opponent is set to be rejected from being selected as an opponent candidate when the opponent candidate is selected. Battle system.   2. The communication battle system according to claim 1, wherein the terminal device further includes a setting canceling unit that cancels the setting of an opponent who does not desire a battle set by the battle rejection setting unit at the terminal. In a server device that provides a battle service for playing a battle game between a plurality of terminals connected via a communication means,
Condition receiving means for receiving conditions regarding opponents of the battle game from each terminal;
A match rejection receiving means for receiving designations of opponents that do not wish to play from each terminal;
An opponent candidate selecting means for selecting an opponent candidate based on the condition received by the condition receiving means;
A server apparatus, comprising: a selection prohibiting unit that prevents an opponent who does not desire a battle received by the battle rejection receiving unit from being selected as an opponent candidate.   5. The server according to claim 4, wherein the selection prohibiting means is configured to prevent an opponent for which the terminal has been set as a opponent refusal from being selected as an opponent candidate when the opponent candidate is selected. apparatus.

Images