Technical Question From: "Chris Williams" <williac6@rjrt.com> Date: Wed, 19 Jul 2000 00:00:00 +0000 Ok, I'm working on my PBM, which will be computer moderated, and I've come to my first major hurdle. (Ok, perhaps not major, but significant...) 1st question: What is the fairest method for processing identical orders issued in the same location at same time. Ex: Player A and Player T are both in a room, and there is a piece of treasure on the floor. Assuming they are both an equal distance from the treasure, and they issue orders in the same sequence (i.e. move, move, grab), how do you determine who gets it? Pure random? 2nd question: When you have a dungeon full of characters, monsters and NPCs, how do you process all the orders simultaneously? Assuming each character (and monster & NPC) can perform multiple actions per turn. Do you: a) loop through each map location and process everyones (including monsters and NPCs) first action, then loop through and process 2nd action, 3rd, etc... b) loop through each character and process each first action, then repeat for 2nd, 3rd, etc c) another way I haven't thought of B doesn't really seem fair as the same characters would always go first, right? Unless you sort the list by Character (or monster) speed. Any advice would be appreciated... Chris Williams Referenced By Up