- v50 information can now be added to pages in the main namespace. v0.47 information can still be found in the DF2014 namespace. See here for more details on the new versioning policy.
- Use this page to report any issues related to the migration.
Difference between revisions of "User talk:Bidok"
LaVacaMorada (talk | contribs) |
|||
| Line 27: | Line 27: | ||
##### ##### ##### | ##### ##### ##### | ||
It relies on the animal finding the shortest of two paths to the exit. This was the most efficient design I could think of - using a ladder to exit on a different z-level so that more gates can be fit into the same amount of space. You can see that it's really a loop; if you "rotate" each tile of the "loop" by two positions, you can put the exit hall at the tip of the shape... but when I did it that way the wall grates were difficult to build (they can't be built on a diagonal, so the dwarf gets trapped between them). It's less resources and faster than (NOT A) NOR (NOT B), making computing less tedious. --[[User:Sf17k|Sf17k]] 18:09, 16 August 2009 (UTC) | It relies on the animal finding the shortest of two paths to the exit. This was the most efficient design I could think of - using a ladder to exit on a different z-level so that more gates can be fit into the same amount of space. You can see that it's really a loop; if you "rotate" each tile of the "loop" by two positions, you can put the exit hall at the tip of the shape... but when I did it that way the wall grates were difficult to build (they can't be built on a diagonal, so the dwarf gets trapped between them). It's less resources and faster than (NOT A) NOR (NOT B), making computing less tedious. --[[User:Sf17k|Sf17k]] 18:09, 16 August 2009 (UTC) | ||
| + | |||
| + | == Memory == | ||
| + | |||
| + | Could you describe in couple of words how does it work, please? --[[Special:Contributions/93.73.169.25|93.73.169.25]] 20:19, 18 January 2010 (UTC) | ||
Revision as of 20:19, 18 January 2010
Cat Logic
It may be pretty fast and reliable, but it'd be a mistake to call it 100% reliable. Cats path through doors trying to get to vermin, usually. If a rat teleports inside the gate -- and teleport they do -- you could have lava flooding prematurely ;) --Corona688 16:58, 6 July 2009 (UTC)
- On the other hand you could use dog or horse - they don't have [VERMIN_HUNTER] tag so as long as you have proper meeting area they will try to go there, am I right? ^^ thats why I named this "animal logic" not only cats. I used Kittens just for funny example, maybe I should change that.. --Bidok 09:36, 7 July 2009 (UTC)
- Real dwarves use megabeasts. --LaVacaMorada 07:53, 19 November 2009 (UTC)
And gate
I tried to come up with a design for some gate besides NOT and NOR, to cut down on the resources it would take to build computers in DF. After a few failures, I discovered that this AND gate seems to work pretty well. You can add it to your page if you like:
##### ## <X## # ###D# ##D^X## ##### # - wall ^ - pressure plate (output) X - wall grate/door (input) D - door unpassable to pets < - stairs (exit, which the animal seeks)
Or instead of using stairs, put the exit hall in one of three locations:
# # # # # # ## ## ### # #### # ## X## ## X## ## X## # ###D# # ###D# # ###D# ##D^X## ##D^X## ##D^X## ##### ##### #####
It relies on the animal finding the shortest of two paths to the exit. This was the most efficient design I could think of - using a ladder to exit on a different z-level so that more gates can be fit into the same amount of space. You can see that it's really a loop; if you "rotate" each tile of the "loop" by two positions, you can put the exit hall at the tip of the shape... but when I did it that way the wall grates were difficult to build (they can't be built on a diagonal, so the dwarf gets trapped between them). It's less resources and faster than (NOT A) NOR (NOT B), making computing less tedious. --Sf17k 18:09, 16 August 2009 (UTC)
Memory
Could you describe in couple of words how does it work, please? --93.73.169.25 20:19, 18 January 2010 (UTC)