Re: The n-knights problem

Bill Spight <bspight@xxxxxxxxxxxx> writes:

What Lash wants the program to do, I believe, is to figure out that a
knight cannot attack a square of a different color, and to do so without
having a color relation in the database

This is expressible as a first-order formula that can be derived from
the initial set of axioms. Surely you don't expect a program or human
to derive the concept of "all attacked squares are of the same colour"
out of the blue, without any knowledge of the problem or what the
board looks like?

Best, -- Markus.
.

Relevant Pages

  • Re: The n-knights problem
    ... knight cannot attack a square of a different color, ... having a color relation in the database, and then to use that fact in a ... I believe that, while it must be possible to write software that can form and utilize a concept in this way, it is something that we won't be achieved for decades; and when it is achieved, "the singularity" won't be far off. ...
    (comp.lang.prolog)
  • Re: The n-knights problem
    ... knight cannot attack a square of a different color, ... having a color relation in the database ... This is expressible as a first-order formula that can be derived from ...
    (comp.lang.prolog)
  • Re: Some combat questions
    ... Still trying to get my head around 3.5 combat rules. ... surrounding him (and the square he's in, ... Or a full round disengagement. ... You can't attack him, he can ...
    (rec.games.frp.dnd)
  • Re: Tiny Creatures - Sharing Space?
    ... The creature provokes attacks of ... You can't end your movement in the same square ... "Tiny, Diminutive, and Fine Creatures: ... This provokes an attack of opportunity from the ...
    (rec.games.frp.dnd)
  • Re: Reach and picking up objects
    ... opportunity attacks from creatures who threaten that square, ... still provoke an AOO even though you don't technically enter the square. ... the character you attack, provided she is armed.] ...
    (rec.games.frp.dnd)