6 ms·

Ah, I see. I'm afraid I don't have any advice on how to define the conditionals because I don't know a distributed algorithm for solving sudoku. Presumably yo

Ah, I see. I'm afraid I don't have any advice on how to define the conditionals because I don't know a distributed algorithm for solving sudoku. Presumably you'll need some sort of guarantee that the sudoku has a unique solution, otherwise things could get very messy and/or slow. And you won't be able to fit the board state in 32 bits, even if you can somehow take out rotations and such, so you can't have the full current state available to a given cell. I suspect just throwing DL at it without giving it more to go on won't find a solution in a reasonable amount of time.

RosanaAnaDana 8y ago
When I say conditionals, I mean the particular rules for the automata. So like GoL the data going into a state change is a count of the neighborhood in the area of the cell. There are some thresholds (number of neighbors), and then based on the conditionals, the state is updated. So one conditional is the size/ dimensionality of the neighborhood. Another, in your case, is the class of the pixels. I meant to take some time this weekend to dig into your code and look at how you've structured your conditionals.