<GenTooMan>
Honestly it is a fairly difficult problem. Yes parallelism is possible. Iterating through each possible solution is a sure bet and allows you to keep things somewhat orderly. So you can know you have a solution.
<shapr>
could be done monte carlo tree search style
whitequark has joined #yosys
X-Scale has quit [*.net *.split]
Thorn has quit [*.net *.split]
_whitelogger has joined #yosys
Cerpin has quit [Ping timeout: 245 seconds]
pie_ has quit [Ping timeout: 250 seconds]
<ZirconiumX>
So, reading pepijndevos's code raises a question
<ZirconiumX>
What's the difference between `always @(*) A = B;` and `assign A = B;`?
emeb has quit [Quit: Leaving.]
<ZirconiumX>
As I understand the former, it'll run whenever B is updated, so isn't it functionally identical?