About: Stripes?   Sponge Permalink

An Entity of Type : dbkwik:resource/U3deC9qR3btFCKjN3a2lUg==, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Stripes? (spelled with the question mark) is the 143rd level in Chip's Challenge 1. Upon playing the level for some length of time, it is apparent that the invisible walls which make up this level are roughly arranged in a "stripe" pattern, which sometimes allows Chip through to collect more chips. There are eighteen "stripes", each broken somewhere, and some with chips and some without. A full map of Stripes? illustrates this pattern: The full route to Stripes? will be given, since this is a long maze level:

AttributesValues
rdf:type
rdfs:label
  • Stripes?
rdfs:comment
  • Stripes? (spelled with the question mark) is the 143rd level in Chip's Challenge 1. Upon playing the level for some length of time, it is apparent that the invisible walls which make up this level are roughly arranged in a "stripe" pattern, which sometimes allows Chip through to collect more chips. There are eighteen "stripes", each broken somewhere, and some with chips and some without. A full map of Stripes? illustrates this pattern: The full route to Stripes? will be given, since this is a long maze level:
Level
  • 143(xsd:integer)
dcterms:subject
chips available
  • 23(xsd:integer)
difficulty lynx
  • 3(xsd:integer)
bold lynx
  • 858(xsd:integer)
Password
  • OKOR
levelset
bold difficulty ms
  • 4(xsd:integer)
bold ms
  • 858(xsd:integer)
bold complexity ms
  • 1(xsd:integer)
difficulty ms
  • 3(xsd:integer)
bold difficulty lynx
  • 4(xsd:integer)
bold complexity lynx
  • 1(xsd:integer)
Hint
  • No
chips required
  • 23(xsd:integer)
Name
  • STRIPES?
dbkwik:chipschalle...iPageUsesTemplate
Time
  • No
abstract
  • Stripes? (spelled with the question mark) is the 143rd level in Chip's Challenge 1. Upon playing the level for some length of time, it is apparent that the invisible walls which make up this level are roughly arranged in a "stripe" pattern, which sometimes allows Chip through to collect more chips. There are eighteen "stripes", each broken somewhere, and some with chips and some without. A full map of Stripes? illustrates this pattern: The full route to Stripes? will be given, since this is a long maze level: D 5L UL 6:RD U 4L (4:UL L 2D 3:RD) 3:RD D 2L U 2L D 5:DR 14:LU 4:DR 2D 2L (3:UL 3L 3:UL) 11:RD 3D RD 5:UL (6:UL LD 4:DR) 3D 4:RD D 2L 8:UL L (2L 3:UL 3U 7:UL [2U 2R 7:DR] 2L 3:LU) 5D RD 2R (2R 7:DR) 2D 4:RD (D 2L) 18:UL L (U 3:UL 2L D, 2D 11:RD 3D R 2D 2L 7:UL) 3L 2D R 2D (2R 10:DR) 2D 3:RD DL 4:LU 2:DR 4D 5:RD (4R 3:DR) L 2D RD 7:UL R 4D R 3D 3L.
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