View Single Post
Old 03-22-2004, 11:26 PM   #4 (permalink)
KnifeMissile
 
KnifeMissile's Avatar
 
Location: Waterloo, Ontario
By the way, when you say Mechwarrior, do you mean Battletech? Mechwarrior is the roleplaying game, while Battletech is the table top game. If you're replicating the table top game, I assume you have the rulebook with you, so it's kind of surprising that you'd mix the two up...

Anyway, is there a particular reason why you'd be programming in pure C? Even if you don't use the object oriented programming aspects of C++, it still offers many advantages.

Okay, suppose you are programming in C. You'd still want to learn how to use structures. It may seem like a simple idea but they are powerful and will really help your code make sense.

Anyway, enough of that. Onto your problem! You claim to have the grid problem figured out so I'll leave that to you (although your example of the two dimensional array suggests that you don't understand your grid problem but, whatever--listen to Yakk advice!).

You should probably notice that 6 * 12 &ne 146 variables. Anyway, there are two ways you can go about this. The static way (which you seem keen on) and the dynamic way. Lets start with the static way.

You have a structure for each limb. Each limb structure will have an array big enough for the maximum number of items for that limb (I happen to know that not all limbs can have 12 items). If these items have state (they can be destroyed or have ammo) then the elements of this array are, themselves, structures that contain the necessary info, like item type (although this would mean they'd all have to carry this info, even if it doesn't apply--like ammo for your lasers). The static method has the dubious claim of being simpler but, as you have pointed out, allocates a lot of resources (although it's highly unlikely that you don't have these resources). After all, a limb has a static array big enuogh for twelve items, even if it is only equiped with one!

Now, lets look at the dynamic way. Each limb can be a structure that will have a linked list of items. Just like the static way, if the items have state, this will be a linked list of structures that contain state info of each item. Because these are linked lists, they will only allocate resources that are needed. After all, if your mech is fully loaded with 146 (or however many) items, then you really do need 146 slots, right! There's no getting around that... But at least you'll only using the resoures you need and that is the best solution you can get for your concerns of using up too many resources.

If you are intimidated by the use of structures or don't know what a linked list is, then may I kindly suggest that you don't know enough about programming to really implement a game as sophisticated as Battlemech. Practice a little more with simpler projects and this stuff will become second nature to you...

Good luck!
KnifeMissile is offline  
 

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 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360