Talk:Wave function collapse: Difference between revisions

: That is an algorithm which works, but it's not the only valid approach. For example, instead of using indices, we could use a bitmask. Here, if a single bit is set, that selects the tile. If multiple bits are set, the tile has not yet been determined. The number of set bits in the bitmask here would be the entropy of that grid location.

 

 

 

== Vote for deletion ==

We have been getting a bunch of new tasks lately with absolutely no verbiage or explanation of algorithm on the "task" page other than a link to "See the algorithm over there". If you can't be bothered to put summary a explanation of the algorithm, and better yet, an reference implementation, enough for a knowledgeable person to figure out how to do it, it comes across as a low effort attempt to drive traffic to somebodies monetized video / page. Not what RosettaCode is about. As it stands, I vote for deletion on this task. I have similar low opinions of [[Boyer-Moore string search]], [[Knuth-Morris-Pratt string search]] and [[Execute_Computer/Zero]‎], but those are issues for other discussion pages. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 21:51, 8 July 2022 (UTC)

::Thirded? I've added a ref to boristhebrave.com, couldn't not in the current climate. We need to define the input file set. Each tile could be represented by four numbers N S E W. The constraint is N must match S vertically and E W horizontally. The concept of least entropy is essentially Warndorf and I've explored extending that beyond Knights tour elsewhere on RC.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 09:17, 9 July 2022 (UTC)

I've made this task before this video, but based on other videos. https://github.com/darkfrei/love2d-lua-tests/blob/main/wave-function-collapse/main.lua

:: There's probably also a constraint that the replication tiles (e.g. 3x3 sized tiles) are "aligned" on a grid which matches that tile size. And, given the "tiling" concept, ... conceptually if we were generating an 11x11 image with 3x3 tiles we'd do something like construt a 12x12 image and then crop it to 11x11. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 08:14, 9 July 2022 (UTC)

:: After playing with some implementations, I'm wondering if maybe there's a bit of smoke and mirrors in the implementation at https://github.com/mxgmn/WaveFunctionCollapse#. Edit: no smoke and mirrors -- but the adjacency constraint is only one layer of pixels deep. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 10:00, 10 July 2022 (UTC)

 

== Solutions ==

: Perhaps ironically, this is analogous to issues with quantum mechanics in general. (QM is not particularly efficient nor insightful, but it kinda works and throwing it away would be a shame.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 10:15, 12 July 2022 (UTC)

: "QM is not insightful" hmmm, well that is just wrong. This task is not QM it is a simple problem in searching obfuscated to a degree worthy of Paddy3118. To move from "the initially linked silly youtube video" to using an initial image it is necessary to write code which can read the image, split it into tiles and convert the pixel data along each edge into a number using some sort of hash. The method I have described above can then generate possible values for result. Code is then needed to convert result into a new image. Is that too much for RC? remains to be seen.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:23, 12 July 2022 (UTC)