(Created page with "Landing page for guides.") |
mNo edit summary |
||
| Line 1: | Line 1: | ||
{| style="border-collapse: collapse;" | |||
|- | |||
| [[File:WD GuideLink.png|frameless|center|upright=1.75|link=Building Circuits with Words|alt=Building Circuits with Words]] || style="padding-left:8px;max-width:20em" | '''Building Circuits with Words'''<br><br>A guide for beginners about transfering descriptions of a truth table into a circuit. | |||
|- | |||
| [[File:KV GuideLink.png|frameless|center|upright=1.75|link=K-map|alt=K-maps]] || style="padding-left:8px;max-width:20em" | '''K-maps'''<br><br>A K-Map or Karnaugh-Veitch-Diagramm is a technique to build a small circuit for 4 input variables. | |||
|- | |||
| [[File:SM GuideLink.png|frameless|center|upright=1.75|link=State Machines -or- How to solve the maze with 2 gates|alt=State Machines-or-How to solve the maze with 2 gates]] || style="padding-left:8px;max-width:20em" | '''State Machines -or-<br>How to solve the maze with 2 gates'''<br><br>A guide about state machines and how they can be used to solve the maze level with only 2 gates. | |||
|} | |||
Revision as of 17:51, 24 November 2023
 |
Building Circuits with Words A guide for beginners about transfering descriptions of a truth table into a circuit. |
 |
K-maps A K-Map or Karnaugh-Veitch-Diagramm is a technique to build a small circuit for 4 input variables. |
 |
State Machines -or- How to solve the maze with 2 gates A guide about state machines and how they can be used to solve the maze level with only 2 gates. |
Pages in category "Guide"
The following 4 pages are in this category, out of 4 total.