Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
If I understand your question correctly (I'll rephrase what I understood), you're asking for a mod which takes a blueprint / creation of logic gates, extracts all the information about what boolean operators are used and which connections there are and then recreate this exact configuration with the logic blocks again, just smaller, maybe as a cube or something.
I can't judge for certain the viability of this. Scanning circuits is possible, creating parts in the world, attaching them to each other, as well as creating connections between them is possible via the scripting API, I would say that it technically should be doable.
Under the assumptions above, I don't think this would be a feature that I'd be aiming for, for this mod. But it's a nice idea and I could imagine that, should there be nobody else taking on this idea, I could create a separate mod which does exactly that.
I'll think about it and whether this fits well within the current theme of this mod or if it should be its own mod. I'll do a small analysis of all the requirements and other stuff, before giving a definite answer :)
wat if he made a mod for that that is the mudpack compatible and can be used in normal circuits and won't break it but can still function
modpack* autocorrect did it
https://steamcommunity.com/sharedfiles/filedetails/?id=2766004350
That should allow 1-tick generators and timers to be used. A huge upgrade really.
Since there is basically no propagation delay for signals, you can treat everything in an idealised way.
The outputs of combinational sub-circuits can be represented as truth tables listing all the outputs and their respective boolean expression.
Sequential sub-circuits can be looked at as if you had an excitation table which (based on the inputs) shows how the output at time T+1 changes.
Ah i see. That seems to make sequential inputs/outputs a lot more challenging, since we cannot know when a sequence ends. We would need as many lookup tables as time steps (which really defeats the purpose of precalculation). Unless we could specify after how many ticks the circuit should reset, or some other signal. Would that be doable?
Given a one tick generator:
A -> B
A -> C
B -> not C
------------------------------------------------------------------------------
Your timeless lookup table:
A || C
----------
0 || 0
1 || 0 and 1
Lookup table errors because multiple entries when A is true.
--------------------------------------------------------------------------------
Time sensitive lookup table:
A | A-1 | A-x || C
----------------------
0 | 0 | 0 || 0
1 | 0 | 0 || 1
0 | 1 | 0 || 1
1 | 1 | 0 || 0
(rip formatting, it removes spaces)
You see the lookup table includes the time series of the input A, remembering past input X timesteps into the past.
X should be low (maybe upper bound specified by the player and determined through analysis), because the table size grows exponencially with X.
However a one tick generator requires only 2 time steps, which are reasonably few.
--------------------------------------------------------------------------------
I hope this helps!