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
For the transition from "Start" to "Sum1", there are only 4 possible combinations of the two checked array values, 2 have already been accounted for with other transitions, and both of the remaining 2 go to Sum1, so that can just be Default.
Then, you can map out the transitions from Go Left to Sum 0 and Sum 3, then choose which of Sum1 and Sum 2 you want to map out with 3 transitions, while the other will handle the 3 remaining values of the 3 checked array/clutch values by simply checking "i-Pos 0, 1, 2, 3, 4".
Ban, EXACT Complexity match, and no change in speed.
I have found another solution for 3-3 with both speed (20.10) and complexity (370) achieved in one design. Link : https://imgur.com/a/kgjrq36