Timeline for Chasing game on the Go board
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 8, 2022 at 11:20 | history | edited | Ville Salo | CC BY-SA 4.0 |
added 258 characters in body
|
| Sep 8, 2022 at 11:01 | history | edited | Ville Salo | CC BY-SA 4.0 |
added 3064 characters in body
|
| Sep 6, 2022 at 9:30 | comment | added | Ville Salo | I'm glad you pointed out that optimizing the number of stones is maybe not so inspiring, because I did want to mention the "transient angel" idea, and your comments inspired me to put it in an edit. | |
| Sep 6, 2022 at 9:08 | comment | added | Wlod AA | I didn't mean anything like this, sorry. (I've removed that comment). | |
| Sep 6, 2022 at 9:00 | history | edited | Ville Salo | CC BY-SA 4.0 |
added 1340 characters in body
|
| Sep 6, 2022 at 8:54 | history | edited | Ville Salo | CC BY-SA 4.0 |
added 1340 characters in body
|
| Sep 6, 2022 at 8:22 | comment | added | Ville Salo | As for your second comment, your solution sounds better. Consider converting your comment to an answer (and elaborating if necessary), as it is not related to my answer. I'm just reporting how I did it in my head, the angel started pestering me and I had to do something about it. I tried to get a reasonably small number of stones with a human proof, it is not clear to me (but does sound plausible to me) that finding the exact number is within reach of an automatic proof. | |
| Sep 6, 2022 at 8:17 | comment | added | Ville Salo | I don't see it as just "historical background", there are probably dozens of references talking about the same problem (in particular various restrictions on the movement of the Angel). This is simply standard terminology for this type of game. If someone asks us about a thing they decided to call "go algebras", and you notice they are just a specific class of groups, you don't write a go algebra theoretic answer. (This is of course exaggerated a bit, and slightly tongue in cheek.) | |
| Sep 6, 2022 at 8:05 | comment | added | Wlod AA | To me, a simple solution in the given OT's simple terms FIRST could be followed by providing the general and historical background. ##### Anyway, the solution is very simple. In $\ \mathbb Z^2\ $ let the black stone start at the origin $\ (0\ 0).\ $ It may make its first move (either way). Then white can easily prevent black from reaching any point $\ (x\ y)\in\mathbb Z^2\ $ such that $\ |x|+|y|=4\ $ (and soon, white will choke the black stone). One can optimize a bit further but it'd be no more mth but computer science :) . | |
| Sep 6, 2022 at 5:34 | comment | added | Ville Salo | Two more points. 1) Personally I find black/white difficult, I got the order wrong in my initial answer, and I still don't remember which is which. 2) This problem is of no interest to someone looking for information about go, but it is directly related to the Angel problem, even if a relatively trivial contribution. | |
| Sep 6, 2022 at 4:39 | comment | added | Ville Salo | Angel is standard terminology, so I don't get that complaint. | |
| Sep 6, 2022 at 4:28 | comment | added | Ville Salo | EWNS is because it has better names for diagonals than left/right/up/down, and this was not specified on the post. (Maybe you prefer numbers?) | |
| Sep 6, 2022 at 1:14 | history | edited | Ville Salo | CC BY-SA 4.0 |
added 481 characters in body
|
| Sep 6, 2022 at 1:00 | history | edited | Ville Salo | CC BY-SA 4.0 |
edited body
|
| Sep 6, 2022 at 0:54 | history | answered | Ville Salo | CC BY-SA 4.0 |