Timeline for Minimize Manhattan distance travel algorithm
Current License: CC BY-SA 4.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 26, 2019 at 6:45 | review | Close votes | |||
| Sep 30, 2019 at 6:17 | |||||
| Sep 26, 2019 at 0:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 28, 2019 at 23:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 28, 2019 at 22:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 29, 2018 at 21:29 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
added 223 characters in body
|
| Dec 29, 2018 at 19:15 | review | Close votes | |||
| Dec 29, 2018 at 21:29 | |||||
| Dec 29, 2018 at 18:55 | comment | added | John L. | Voting for closure as being unclear because the asker (an unregistered user) has not replied to @rus9384's critical comment above for three months. ( [[0 1] [1 -2]] -> [[-2 1][1 -2]] -> [[-2 2][2 -2]] -> [[0,0][2,-2]] ->[[0,0][0,0]]. However, I doubt this transformation is intended by the asker.) | |
| Dec 28, 2018 at 15:00 | history | tweeted | twitter.com/StackCompSci/status/1078666885925912580 | ||
| Dec 28, 2018 at 11:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 28, 2018 at 10:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 29, 2018 at 10:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 29, 2018 at 8:38 | history | edited | Frabetto | CC BY-SA 4.0 |
clarified
|
| Sep 28, 2018 at 22:58 | comment | added | rus9384 | I don't think replacing elements with their sum. Then [[0 1] [1 -2]] would not work. First move: [[0 2] [2 -2]]. Maybe just move one into another. Which satisfies your description. | |
| Sep 28, 2018 at 14:17 | comment | added | D.W.♦ | OK, I encourage you to edit the question to correct those points. Thank you! | |
| Sep 28, 2018 at 9:02 | comment | added | Frabetto | @YuvalFilmus yes, replacing the two elements with their sum! | |
| Sep 28, 2018 at 9:01 | comment | added | Frabetto | @D.W. yes, with (a1,1) I meant the matrix element at (1,1). Sorry, I only write those on paper! | |
| Sep 27, 2018 at 20:35 | answer | added | D.W.♦ | timeline score: 1 | |
| Sep 27, 2018 at 20:34 | comment | added | D.W.♦ | What does (a1,1) mean? Do you mean the matrix element at (1,1)? What is a1? | |
| Sep 27, 2018 at 16:44 | comment | added | Yuval Filmus | What do you mean by "sums two elements"? Do you mean replacing the two elements with their sum? | |
| Sep 27, 2018 at 10:50 | review | First posts | |||
| Sep 27, 2018 at 16:45 | |||||
| Sep 27, 2018 at 10:49 | history | asked | Frabetto | CC BY-SA 4.0 |