v50 Steam/Premium information for editors
- 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.
This notice may be cached—the current version can be found here.
Editing v0.31:Computing
Jump to navigation
Jump to search
Warning: You are not logged in.
Your IP address will be recorded in this page's edit history.
You are editing a page for an older version of Dwarf Fortress ("Main" is the current version, not "v0.31"). Please make sure you intend to do this. If you are here by mistake, see the current page instead.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 29: | Line 29: | ||
=== Binary logic === | === Binary logic === | ||
| − | Basic binary logic takes one or two input bits and creates an output based on them. The devices that perform these operations are commonly called '''logic gates'''. | + | Basic binary logic takes one or two input bits and creates an output based on them. The devices that perform these operations are commonly called '''logic gates'''.<br /> |
| − | + | * NOT - takes one input and returns the opposite of the input<br /><br /> | |
| − | * NOT - takes one input and returns the opposite of the input | ||
| − | |||
{| class="wikitable" border=1 | {| class="wikitable" border=1 | ||
|- | |- | ||
| Line 43: | Line 41: | ||
| 1 | | 1 | ||
| 0 | | 0 | ||
| − | |} | + | |}<br /> |
| − | |||
* AND - takes two inputs and returns true if both inputs are true | * AND - takes two inputs and returns true if both inputs are true | ||
* OR - takes two inputs and returns true if at least one input is true | * OR - takes two inputs and returns true if at least one input is true | ||
| Line 50: | Line 47: | ||
* NAND - takes two inputs and returns true if either input is false | * NAND - takes two inputs and returns true if either input is false | ||
* NOR - takes two inputs and returns true if both inputs are false | * NOR - takes two inputs and returns true if both inputs are false | ||
| − | * XNOR - takes two inputs and returns true if both inputs are identical | + | * XNOR - takes two inputs and returns true if both inputs are identical<br /><br /> |
| − | |||
{| class="wikitable" border=1 | {| class="wikitable" border=1 | ||
|- | |- | ||
| Line 98: | Line 94: | ||
| 0 | | 0 | ||
| 1 | | 1 | ||
| − | |} | + | |}<br /> |
| − | |||
The most human-understandable logic system requires NOT, AND and OR gates, but having a design for either a NAND or a NOR gate is enough to build any of the other gates. Some gates are easier to create or need fewer components than others depending on what discipline your logic relies on. Designing each individual gate that you will need (or using designs that had each individual gate designed) rather than building a gate out of multiple NAND gates or the like will generally result in your dorfputer reacting faster and using less resources (power, water, kittens, construction materials, what-have-you). | The most human-understandable logic system requires NOT, AND and OR gates, but having a design for either a NAND or a NOR gate is enough to build any of the other gates. Some gates are easier to create or need fewer components than others depending on what discipline your logic relies on. Designing each individual gate that you will need (or using designs that had each individual gate designed) rather than building a gate out of multiple NAND gates or the like will generally result in your dorfputer reacting faster and using less resources (power, water, kittens, construction materials, what-have-you). | ||
| Line 135: | Line 130: | ||
== Examples == | == Examples == | ||
| − | There are few examples of a really useful dwarfputer and some concepts which have the potential to become useful for others. But in most cases they are made just for fun. What doesn't mean to diminish their designers achievements, because these are in general the more complex ones. At the moment there are no known examples of animal or borg logic. | + | There are few examples of a really useful dwarfputer and some concepts which have the potential to become useful for others. But in most cases they are made just for fun. What doesn't mean to diminish their designers achievements, because these are in general the more complex ones.<br />At the moment there are no known examples of animal or borg logic. |
=== Useful === | === Useful === | ||
* Magma trap | * Magma trap | ||
| − | ** This is an example of a useful dwarfputer controlling a magma trap. It automatically floods an area with lava, cleans up and resets afterwards. The timing is perfectly adjusted to let the victims vanish only leaving their valuable metal behind. | + | ** This is an example of a useful dwarfputer controlling a magma trap. It automatically floods an area with lava, cleans up and resets afterwards. The timing is perfectly adjusted to let the victims vanish only leaving their valuable metal behind.<br />video: http://mkv25.net/dfma/movie-1808-perfectmagmatrap<br />design: http://i576.photobucket.com/albums/ss208/kanddak/magmatrap.png |
| − | |||
| − | |||
=== Concepts === | === Concepts === | ||