[MUD-Dev] Clients

[Vadim Tkachenko]

Jon Leonard wrote:
> 
> On Tue, Feb 17, 1998 at 08:40:39PM +0000, Travis Casey wrote:
> > On Monday, 16 February 98, Caliban wrote:

[snip]

> There are quite a few equivalent "machines" characterized by being able
> to calculate anything that is in theory calculable, while being amazingly
> simple to describe and useless to program in.
> 
> Others include:
> State machine with two counters
> State machine with one queue
> Lambda calculus (Functions of one variable, no explicit recursion...)
> Transformational grammars (when you see "abc" replace with "def")

Not quite so for this case, the most noticeable examples are UNIX
sendmail (which is almost all rewriting grammars) and Eliza robot (btw,
the funny consequence is that it is possible to implement Eliza robot
using sendmail - it requires a pervert sense of humor, but greatly
improves the understanding of this technique ;-)

> All of these are far more useful for doing proofs than they are for
> MUD design, and rather represent things to avoid when doing internal
> languages.

Also, what I'm thinking about, is to make NPC engine[s] somewhat based
on Eliza behavior rules, slightly modified for each given NPC...

> Jon Leonard

--
Still alive and smile stays on,
Vadim Tkachenko <VadimT at 4CS.Com>
--
UNIX _is_ user friendly, he's just very picky about who his friends are