Talk:Marching squares: Difference between revisions
→Task needs work: fix blatant mistake on my part
(→Task needs work: fix blatant mistake on my part) |
|||
Line 1:
== Task needs work ==
: A comment on a previous version of this page:
::'''Incorrect:''' The Julia and Python entries also start with the same q-shaped input. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:43, 30 June 2022 (UTC)▼
Currently, the task description does not allow us to determine whether an implementation is correct.
Line 13 ⟶ 17:
0 0 1 1 0
0 0 1 1 0
0 0 0 1 0▼
0 0 0 0 0</pre>
Line 23 ⟶ 28:
0 1 1 1 0</pre>
This transformation lacks symmetry which makes it suspect.
Also, one of the duplicated coordinate pairs corresponds to the beginning and end of the path. (But why is the other coordinate pair duplicated?)
▲<pre>0 0 0 0 0
▲0 0 0 0 0
▲0 0 1 1 0
▲0 0 1 1 0
▲0 0 0 1 0
▲0 0 0 0 0</pre>
▲::'''Incorrect:''' The Julia and Python entries also start with the same q-shaped input. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:43, 30 June 2022 (UTC)
In contrast, the Wren and Phix solutions identify a path with length 11 composed of 10 unique coordinates which would probably correspond to these positions (or maybe this should be shifted up and to the left by one grid coordinate? I'm guessing because I don't know whether the 0,0 coordinate would correspond to the upper left hand corner of the bitmap or if it would be outside the bitmap):
<pre>0 0 0 0 0
Line 45 ⟶ 47:
0 0 0 1 1</pre>
Again, this lacks symmetry
Possibly all of these results are correct. Possibly not. Currently the task is too ambiguous. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 01:34, 30 June 2022 (UTC)
|