| ▲ | taeric 8 days ago |
| I'm not sure I follow? The "winning" condition is different in all of those examples? |
|
| ▲ | tracker1 8 days ago | parent [-] |
| X adjacent cell values in an N dimensional array? For tic tac toe, it's 3 in a row, for connect 4 it's 4 in a row. |
| |
| ▲ | taeric 7 days ago | parent [-] | | Fair enough, I guess. The "available moves" would be dramatically different, such that I'm not clear I see much of a win on this reuse. But, yeah, fair enough. | | |
| ▲ | tracker1 7 days ago | parent [-] | | It was just the simplest case I could think of that would be reasonable. I'm not a heavy enough pure math guy to really get how an Array centric language is even all that valuable myself TBF. |
|
|