Re: Technical Question

From: bro_skrenta@my-deja.com

Date: Tue, 22 Aug 2000 00:00:00 +0000

Want to learn about rich skrenta and the abusive policies of his meta
lynch mob members laisha, goldm, kfander, sh33na, glynis, and the MINOR
CHILD odp editor dannyboy who the ODP staff allowed to edit ponography.
Or how about the comments ODP editor rob jones made in the masonic like
ODP forums in which he stated " most here would agree Rodney King
should have got a bullet in his skull" to which Rich Skrenta stands by,
by giving rob jones no consequence. Want to learn about the *meta lynch
mob that Rich Skrenta allows to abuse others. Then go here!

http://www.egroups.com/messages/xodp/

To see the Current *meta editors attacking ex editors go here!

http://pub14.ezboard.com/ftraffickcommunitytheotherdirectoryproject

To see where this whole story is about to bust open go here
http://www.bizreport.com/

bro_skrenta

In article <8lsp2t02bug@enews2.newsguy.com>,
  skrenta@pbm.com (Rich Skrenta) wrote:
> "Chris Williams" <williac6@rjrt.com> writes:
> > 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?
>
> Olympia has an elaborate system for order precedence; nothing ever
happens
> at the same time, but commands have different priorities, and in the
case
> of a tie the character that has been in the location the longest will
go
> first.  This gives a slight advantage to the "resident" of a location
over
> the newcomer.
>
> > c) another way I haven't thought of
>
> You could do a two-pass order scan, where the first pass would
assemble
> a list of objects and the actions being attempted against them.  A
second
> pass could then arbitrate somehow, perhaps employing custom code.
>
> So if you had two people who tried to get a book
>
> 	feasel> get book
> 	osswid> get book
>
> you'd end up with an action lists against "book" consisting of
>
> 	book:
> 		get,feasel
> 		get,osswid
>
> You could rank all the command on an absolute priority scale, and
> for ties (such as get above), define a default 1/n attempters rule,
> or write custom code (say, that employed the character's agility to
> improve their odds).
>
> This would be more complicated to code, but might be an interesting
> resolution model, if it didn't end up being too annoying to play.
>

Sent via Deja.com http://www.deja.com/
Before you buy.

References

Technical Question
"Chris Williams" <williac6@rjrt.com>
Wed, 19 Jul 2000 00:00:00 +0000
Re: Technical Question
skrenta@pbm.com (Rich Skrenta)
Fri, 28 Jul 2000 00:00:00 +0000

Referenced By

Technical Question
"Chris Williams" <williac6@rjrt.com>
Wed, 19 Jul 2000 00:00:00 +0000
Re: Technical Question
skrenta@pbm.com (Rich Skrenta)
Fri, 28 Jul 2000 00:00:00 +0000