cworld1 / cworld1/nandgame-solution

Doubts about "Optimal"

Open
#1 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
No language data
Stars
1
Forks
0
PR merge metrics
No merged PRs in 30d

Description

I'm sorry, but I have reason to believe that the solution you provided here is far from optimal.The comparison between the following two pictures can serve as sufficient proof:

Image

The first picture shows the final implementation of the **computer** in your solution, which uses a total of 2220 NANDs (RAM not counted).

Image

The second picture shows an alternative implementation of the **computer**, using only 1369 NANDs, which is significantly superior to your implementation. Even so, it would be presumptuous to claim that it is optimal.

Actually, we cannot prove whether the implementation of a complex component in nandgame has truly achieved an "optimal solution", so it is best for us to avoid making overly confident claims.

I’m also curious to explore if we can push the optimization further. For reference, here is my personal best attempt so far: https://zhuanlan.zhihu.com/p/2048306269203718209. I’d be very interested in discussing potential improvements with you.

Contributor guide

No contributing guide indexed for this repository

Research direction

The issue identifies the computer implementation and its NAND counts but names no repository file or test. Begin by locating that implementation and the wording that calls the solution “optimal”; done means removing or qualifying unsupported optimality claims, with any further NAND reduction treated as separate exploratory work.

Written by the indexing model from the issue text.

Assessment

Domain
performance
Issue type
Documentation
Difficulty
5/5
Estimated time
Over a week
Activity status
Quiet
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.