About: Game mechanics/Enemies   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : dbkwik.org associated with source dataset(s)

If the Enemy is sleeping, then the notice algorithm is: * i = distanceFromEnemyToHero + heroStealth * If the Hero/ine is flying: i = i + 2 * The chance of being noticed is: 1/i If the Enemy is wandering: * i = distanceFromEnemyToHero/2 + heroStealth * The chance of being noticed is: 1/i

AttributesValues
rdfs:label
  • Game mechanics/Enemies
rdfs:comment
  • If the Enemy is sleeping, then the notice algorithm is: * i = distanceFromEnemyToHero + heroStealth * If the Hero/ine is flying: i = i + 2 * The chance of being noticed is: 1/i If the Enemy is wandering: * i = distanceFromEnemyToHero/2 + heroStealth * The chance of being noticed is: 1/i
dcterms:subject
dbkwik:pixeldungeo...iPageUsesTemplate
abstract
  • If the Enemy is sleeping, then the notice algorithm is: * i = distanceFromEnemyToHero + heroStealth * If the Hero/ine is flying: i = i + 2 * The chance of being noticed is: 1/i If the Enemy is wandering: * i = distanceFromEnemyToHero/2 + heroStealth * The chance of being noticed is: 1/i
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software