File: be_ai_gen.c

package info (click to toggle)
iortcw 1.51.c%2Bdfsg1-7
  • links: PTS, VCS
  • area: contrib
  • in suites: forky, sid, trixie
  • size: 25,304 kB
  • sloc: ansic: 457,326; cpp: 6,507; makefile: 4,737; sh: 1,292; asm: 1,176; xml: 31
file content (151 lines) | stat: -rw-r--r-- 4,611 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/*
===========================================================================

Return to Castle Wolfenstein multiplayer GPL Source Code
Copyright (C) 1999-2010 id Software LLC, a ZeniMax Media company. 

This file is part of the Return to Castle Wolfenstein multiplayer GPL Source Code (“RTCW MP Source Code”).  

RTCW MP Source Code is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

RTCW MP Source Code is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with RTCW MP Source Code.  If not, see <http://www.gnu.org/licenses/>.

In addition, the RTCW MP Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the RTCW MP Source Code.  If not, please request a copy in writing from id Software at the address below.

If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA.

===========================================================================
*/


/*****************************************************************************
 * name:		be_ai_gen.c
 *
 * desc:		genetic selection
 *
 *
 *****************************************************************************/

#include "../qcommon/q_shared.h"
#include "l_memory.h"
#include "l_log.h"
#include "l_utils.h"
#include "l_script.h"
#include "l_precomp.h"
#include "l_struct.h"
#include "aasfile.h"
#include "botlib.h"
#include "be_aas.h"
#include "be_aas_funcs.h"
#include "be_interface.h"
#include "be_ai_gen.h"

//===========================================================================
//
// Parameter:			-
// Returns:				-
// Changes Globals:		-
//===========================================================================
int GeneticSelection( int numranks, float *rankings ) {
	float sum;
	int i, index;

	sum = 0;
	for ( i = 0; i < numranks; i++ )
	{
		if ( rankings[i] < 0 ) {
			continue;
		}
		sum += rankings[i];
	} //end for
	if ( sum > 0 ) {
		//select a bot where the ones with the higest rankings have
		//the highest chance of being selected
		//sum *= random();
		for ( i = 0; i < numranks; i++ )
		{
			if ( rankings[i] < 0 ) {
				continue;
			}
			sum -= rankings[i];
			if ( sum <= 0 ) {
				return i;
			}
		} //end for
	} //end if
	  //select a bot randomly
	index = random() * numranks;
	for ( i = 0; i < numranks; i++ )
	{
		if ( rankings[index] >= 0 ) {
			return index;
		}
		index = ( index + 1 ) % numranks;
	} //end for
	return 0;
} //end of the function GeneticSelection
//===========================================================================
//
// Parameter:			-
// Returns:				-
// Changes Globals:		-
//===========================================================================
int GeneticParentsAndChildSelection( int numranks, float *ranks, int *parent1, int *parent2, int *child ) {
	float rankings[256], max;
	int i;

	if ( numranks > 256 ) {
		botimport.Print( PRT_WARNING, "GeneticParentsAndChildSelection: too many bots\n" );
		*parent1 = *parent2 = *child = 0;
		return qfalse;
	} //end if
	for ( max = 0, i = 0; i < numranks; i++ )
	{
		if ( ranks[i] < 0 ) {
			continue;
		}
		max++;
	} //end for
	if ( max < 3 ) {
		botimport.Print( PRT_WARNING, "GeneticParentsAndChildSelection: too few valid bots\n" );
		*parent1 = *parent2 = *child = 0;
		return qfalse;
	} //end if
	memcpy( rankings, ranks, sizeof( float ) * numranks );
	//select first parent
	*parent1 = GeneticSelection( numranks, rankings );
	rankings[*parent1] = -1;
	//select second parent
	*parent2 = GeneticSelection( numranks, rankings );
	rankings[*parent2] = -1;
	//reverse the rankings
	max = 0;
	for ( i = 0; i < numranks; i++ )
	{
		if ( rankings[i] < 0 ) {
			continue;
		}
		if ( rankings[i] > max ) {
			max = rankings[i];
		}
	} //end for
	for ( i = 0; i < numranks; i++ )
	{
		if ( rankings[i] < 0 ) {
			continue;
		}
		rankings[i] = max - rankings[i];
	} //end for
	  //select child
	*child = GeneticSelection( numranks, rankings );
	return qtrue;
} //end of the function GeneticParentsAndChildSelection