※理由はわかりませんがforループ内の半角'<'が化けるので、そこは全角'＜'に置換してます。他にも化けてるところがあるかも・・・
#include "stdafx.h"
// Team名定義
enum{
CHOOP = 0,
ASAI,
FANTA,
GATAS,
TEAM_NUM
};
// 勝敗判定パーセンテージ
#define PER_TEAMA_WIN (0.35) // TeamA勝利確率35%
#define PER_TEAMB_WIN (0.35) // TeamB勝利確率35%
#define PER_DRAW (0.3) // 引き分け確率30%
// 残試合数
#define MATCH_NUM (12)
// 対戦表
int nMatch[MATCH_NUM*2] = {
CHOOP, ASAI,
CHOOP, ASAI,
CHOOP, FANTA,
CHOOP, FANTA,
CHOOP, GATAS,
CHOOP, GATAS,
ASAI, FANTA,
ASAI, FANTA,
ASAI, GATAS,
ASAI, GATAS,
FANTA, GATAS,
FANTA, GATAS,
};
//最終的な順位可能性
double FinalPossibility[TEAM_NUM][TEAM_NUM];
// ワーク構造体
typedef struct{
int nPoint[TEAM_NUM]; // 勝ち点
int nMargin[TEAM_NUM]; // 得失点差
int nGoal[TEAM_NUM]; // 総得点
double possibility;
}POINT;
int nMatchCounter; // シミュレート数カウンタ
int nMatchCounter_ign;
// 順位決定関数
void CountResult(POINT *pPoint)
{
int nSort[TEAM_NUM];
int nI, nJ, tmp;
nSort[0] = CHOOP;
nSort[1] = ASAI;
nSort[2] = FANTA;
nSort[3] = GATAS;
// 勝ち点、得失点差、総得点の優先度でソート
for ( nI=0; nI＜TEAM_NUM-1; nI++){
for ( nJ=nI+1; nJ＜TEAM_NUM; nJ++){
if ( pPoint->nPoint[nSort[nI]] < pPoint->nPoint[nSort[nJ]] ){
tmp = nSort[nI];
nSort[nI] = nSort[nJ];
nSort[nJ] = tmp;
}
else if ( pPoint->nPoint[nSort[nI]] == pPoint->nPoint[nSort[nJ]] ){ // 勝ち点が同じ
if ( pPoint->nMargin[nSort[nI]] < pPoint->nMargin[nSort[nJ]] ){
tmp = nSort[nI];
nSort[nI] = nSort[nJ];
nSort[nJ] = tmp;
}
else if ( pPoint->nMargin[nSort[nI]] == pPoint->nMargin[nSort[nJ]] ){ // 勝ち点、得失点差が同じ
if ( pPoint->nGoal[nSort[nI]] < pPoint->nGoal[nSort[nJ]] ){
tmp = nSort[nI];
nSort[nI] = nSort[nJ];
nSort[nJ] = tmp;
}
else if ( pPoint->nGoal[nSort[nI]] == pPoint->nGoal[nSort[nJ]] ){ // 勝ち点、得失点、総得点が同じ
pPoint->possibility = 0;
nMatchCounter_ign++;
}
}
}
}
}
// 順位可能性変数に加算
FinalPossibility[0][nSort[0]] += pPoint->possibility;
FinalPossibility[1][nSort[1]] += pPoint->possibility;
FinalPossibility[2][nSort[2]] += pPoint->possibility;
FinalPossibility[3][nSort[3]] += pPoint->possibility;
nMatchCounter++;
}
// ※リカーシブ
// 結果シミュレートメイン
void Simulate(int nDepth, POINT point)
{
int nTeamA, nTeamB;
int nPointA, nPointB;
int nMarginA, nMarginB;
int nGoalA, nGoalB;
double possibility;
// データバックアップ
nTeamA = nMatch[(nDepth-1)*2];
nTeamB = nMatch[(nDepth-1)*2+1];
nPointA = point.nPoint[nTeamA];
nPointB = point.nPoint[nTeamB];
nMarginA = point.nMargin[nTeamA];
nMarginB = point.nMargin[nTeamB];
nGoalA = point.nGoal[nTeamA];
nGoalB = point.nGoal[nTeamB];
possibility = point.possibility;
// TeamAが1-0勝利
point.nPoint[nTeamA] = nPointA + 3;
point.nPoint[nTeamB] = nPointB;
point.nMargin[nTeamA] = nMarginA + 1;
point.nMargin[nTeamB] = nMarginB - 1;
point.nGoal[nTeamA] = nGoalA + 1;
point.nGoal[nTeamB] = nGoalB;
point.possibility = possibility * PER_TEAMA_WIN;
if ( nDepth == MATCH_NUM ){ // 最終戦
CountResult(&point); // 結果集計
}
else{
Simulate(nDepth+1, point); // リカーシブ
}
// TeamBが１点差勝利
point.nPoint[nTeamA] = nPointA;
point.nPoint[nTeamB] = nPointB + 3;
point.nMargin[nTeamA] = nMarginA - 1;
point.nMargin[nTeamB] = nMarginB + 1;
point.nGoal[nTeamA] = nGoalA;
point.nGoal[nTeamB] = nGoalB + 1;
point.possibility = possibility * PER_TEAMB_WIN;
if ( nDepth == MATCH_NUM ){ // 最終戦
CountResult(&point); // 結果集計
}
else{
Simulate(nDepth+1, point); // リカーシブ
}
// 1-1で引き分け
point.nPoint[nTeamA] = nPointA + 1;
point.nPoint[nTeamB] = nPointB + 1;
point.nMargin[nTeamA] = nMarginA;
point.nMargin[nTeamB] = nMarginB;
point.nGoal[nTeamA] = nGoalA + 1;
point.nGoal[nTeamB] = nGoalB + 1;
point.possibility = possibility * PER_DRAW;
if ( nDepth == MATCH_NUM ){ // 最終戦
CountResult(&point); // 結果集計
}
else{
Simulate(nDepth+1, point); // リカーシブ
}
}
// メイン
int main(int argc, char* argv[])
{
POINT point;
int nI, nJ;
// 現在の状況
// 勝ち点
point.nPoint[CHOOP] = 16;
point.nPoint[ASAI] = 15;
point.nPoint[FANTA] = 14;
point.nPoint[GATAS] = 10;
// 得失点差
point.nMargin[CHOOP] = 3;
point.nMargin[ASAI] = 5;
point.nMargin[FANTA] = 5;
point.nMargin[GATAS] = 1;
// 総得点
point.nGoal[CHOOP] = 9;
point.nGoal[ASAI] = 13;
point.nGoal[FANTA] = 8;
point.nGoal[GATAS] = 8;
// その他準備
point.possibility = 1.0;
nMatchCounter = 0;
nMatchCounter_ign = 0;
for ( nI=0; nI＜TEAM_NUM; nI++){
for ( nJ=0; nJ＜TEAM_NUM; nJ++){
FinalPossibility[nI][nJ] = 0.0;
}
}
// １試合目からシミュレーション実行
Simulate(1, point);
// 最終結果出力
printf("CHOOP\n");
for ( nI=0; nI＜TEAM_NUM; nI++){
printf("%d位確率 : %f \n", nI+1, FinalPossibility[nI][CHOOP]);
}
printf("\n");
printf("ASAI RED ROSE\n");
for ( nI=0; nI＜TEAM_NUM; nI++){
printf("%d位確率 : %f \n", nI+1, FinalPossibility[nI][ASAI]);
}
printf("\n");
printf("FANTASISITA\n");
for ( nI=0; nI＜TEAM_NUM; nI++){
printf("%d位確率 : %f \n", nI+1, FinalPossibility[nI][FANTA]);
}
printf("\n");
printf("Gatas\n");
for ( nI=0; nI＜TEAM_NUM; nI++){
printf("%d位確率 : %f \n", nI+1, FinalPossibility[nI][GATAS]);
}
printf("シミュレート総数%d : （除外%d）\n", nMatchCounter, nMatchCounter_ign);
getchar();
return 0;
}
- 2005/01/01(土) 11:54:27|
- 未分類|
-
トラックバック：0|
-
コメント：0
Recent Entries