|
= August 12 =
== Spike in readership ==
[[Hop water]] had a [https://pageviews.wmcloud.org/?project=en.wikipedia.org&platform=all-access&agent=user&redirects=0&range=latest-20&pages=Hop_water notable spike] on 5 August. I started the article, so I'm curious if someone can tell me where it came from. [[User:Gråbergs Gråa Sång|Gråbergs Gråa Sång]] ([[User talk:Gråbergs Gråa Sång|talk]]) 14:30, 12 August 2025 (UTC)
:Hi [[User:Gråbergs Gråa Sång|Gråbergs Gråa Sång]], looks like it was an answer to the [[The_New_York_Times_crossword#The_Mini|New York Times' The Mini]] crossword puzzle on August 5.
:I checked [https://trends.google.com/trends/explore?date=today%201-m&q=Hop%20water&hl=en Google trends] to see if it was general internet interest rather than just on Wikipedia's Main page or a random robot issue. I saw "Monterey Bay" as an associated trending search term there and when I googled ''hop water monterey bay'' [https://www.forbes.com/sites/krisholt/2025/08/04/nyt-mini-crossword-tuesday-august-5-clues-answers-extra-hints/ this] Forbes blog-style article on crossword hints for the NYT Mini popped up mentioning hop water.
:I think culturally these crosswords are popular in the US (we probably have an article about that!) so generate a lot of interest, and Wikipedia visits it seems. I am sure many frustrated crossword players are grateful for you starting the article :-). [[User:Commander Keane|Commander Keane]] ([[User talk:Commander Keane|talk]]) 23:54, 12 August 2025 (UTC)
::Thank you very much! [[User:Gråbergs Gråa Sång|Gråbergs Gråa Sång]] ([[User talk:Gråbergs Gråa Sång|talk]]) 05:35, 13 August 2025 (UTC)
::I think the NYT mini crossword has a big readership outside the US, thanks to the popularity of [[Wordle]] (both Wordle and the Mini are part of the NYT Games app). Obviously, the crossword is aimed at a US readership, so some of the terms used are unfamiliar to international readers. Hence spikes in Google/Wikipedia activity. That's certainly the case for me personally. [[User:Chuntuk|Chuntuk]] ([[User talk:Chuntuk|talk]]) 14:20, 14 August 2025 (UTC)
= August 15 =
== Where can I report a problem with Microsoft? ==
I tried to ask a question on https://learn.microsoft.com/en-us/answers/questions/ask/
Which used to be https://answers.microsoft.com/
This was the result
Please fix the following issues to continue:
We encountered an unexpected error. Please try again later. If this issue continues, please open a ticket at https://sitehelp.microsoft.com.
There are specific error details but I'm kind of reluctant to post them here.
So I get this:
Selected user account does not exist in tenant 'Microsoft' and cannot access the application 'eea5f4ef-dd4d-4755-aa86-3e0283223b97' in that tenant. The account needs to be added as an external user in the tenant first. Please use a different account.
I try another way in and get
Sorry, but we’re having trouble signing you in.
AADSTS50020: User account '[my real name]@hotmail.com' from identity provider 'live.com' does not exist in tenant 'Microsoft' and cannot access the application 'eea5f4ef-dd4d-4755-aa86-3e0283223b97'(DevRelMC) in that tenant. The account needs to be added as an external user in the tenant first. Sign out and sign in again with a different Azure Active Directory user account.
I tried going to Azure and they'll let me sign up for a free account but I gave up when they asked for my credit card number. That plus the fact that the site seems to answer only highly technical questions and if they get something irrelevant they just won't bother.— [[User:Vchimpanzee|<span style="color:#070">Vchimpanzee</span>]] • [[User talk:Vchimpanzee|<span style="color:#aa4400"> talk</span>]] • [[Special:Contribs/Vchimpanzee|<span style="color:#700">contributions</span>]] • 23:40, 15 August 2025 (UTC)
:Try non-community support instead and ask your original question: https://support.microsoft.com/en-us/contactus Should be live chat. [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 03:26, 16 August 2025 (UTC) ▼::I thought I had tried that and ended up going in circles but this time it worked. I'll know in a minute if that helped.— [[User:Vchimpanzee|<span style="color:#070">Vchimpanzee</span>]] • [[User talk:Vchimpanzee|<span style="color:#aa4400"> talk</span>]] • [[Special:Contribs/Vchimpanzee|<span style="color:#700">contributions</span>]] • 17:37, 17 August 2025 (UTC)
:::Didn't get what I wanted, but the problem is solved that I needed to ask about, and I was able to ask a question on the site.
:::"I must say, working with you was a nice experience. Thank you for all your patience."— [[User:Vchimpanzee|<span style="color:#070">Vchimpanzee</span>]] • [[User talk:Vchimpanzee|<span style="color:#aa4400"> talk</span>]] • [[Special:Contribs/Vchimpanzee|<span style="color:#700">contributions</span>]] • 18:44, 17 August 2025 (UTC)
::::I'm back with being told to do things I already tried to do that didn't work. Someone needs to solve this problem.— [[User:Vchimpanzee|<span style="color:#070">Vchimpanzee</span>]] • [[User talk:Vchimpanzee|<span style="color:#aa4400"> talk</span>]] • [[Special:Contribs/Vchimpanzee|<span style="color:#700">contributions</span>]] • 17:50, 18 August 2025 (UTC)
= August 19 =
== Shortest video game ==
[[A Short Hike]] (as the name suggests) can be beaten within a few hours. What other games are like that? [[User:JuniperChill|JuniperChill]] ([[User talk:JuniperChill|talk]]) 19:18, 19 August 2025 (UTC)
: "50 Games Like" aims to be a weighted-category based games recomendation engine. Just based on ''A Short Hike'', it lists [https://www.50gameslike.com/games-like/a-short-hike these games]. But that's based on ''all'' the categories ''A Short Hike'' is in ("cute", "adventure", "exploration", etc.). If you just want "short" games, you click on just the category button and it gives you [https://www.50gameslike.com/best-games-by-type/short short games in all genres] (which aren't like ''A Short Hike'', except in shortness). Subjectively, it looks more useful than Steam's recommendation engine, which gives me some fairly bonkers suggestions ("you liked FTL, so you might like Doom Eternal"). -- [[User:Finlay McWalter|Finlay McWalter]]'''··–·'''[[User talk:Finlay McWalter|Talk]] 19:40, 19 August 2025 (UTC)
:Finlay's answer is excellent, but I can't help mention that the original ''[[Portal (video game)|Portal]]'' game is both famously short and considered one of the best games of all time. If shortness is the prime criteria, you could do worse. But apart from the duration, it's nothing like ''A Short Hike''. [[User:Matt Deres|Matt Deres]] ([[User talk:Matt Deres|talk]]) 12:40, 20 August 2025 (UTC)
::Guess that means that ''A Short Hike'' is unique in its shortness, cosiness, and adventure. ''[[Lil Gator Game]]'' is quite close in terms of layout and that the player can climb but idk about its length since I haven't played the latter, but have played the former. I was mostly focusing on shortness, hence the title of the discussion. [[User:JuniperChill|JuniperChill]] ([[User talk:JuniperChill|talk]]) 19:37, 20 August 2025 (UTC)
:Check out https://howlongtobeat.com/user/a19xys/lists/25829/%5B-Short-%26-Good-(-5h)-%5D, perhaps. [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 23:37, 20 August 2025 (UTC)
:@[[User:JuniperChill|JuniperChill]] In Far Cry 4, if you just sit at the table and wait for Pagan Min to return, it is a very short video game. Less than 15 minutes. [[User:Polygnotus|Polygnotus]] ([[User talk:Polygnotus|talk]]) 00:56, 21 August 2025 (UTC)
::Well, consuming the crab rangoon can't be so bad it's considered an "adventure", can it? [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 01:04, 21 August 2025 (UTC)
:::@[[User:Aaron Liu|Aaron Liu]] Traveling to a country far away, ending up in a firefight in which some people get killed, seeing a murder close-up (over a simple miscommunication), getting invited to the palace of the dictator of said country as a VIP guest, bringing moms ashes to their final resting place and learning about your tragic family history is quite an adventure (although some would just call that Tuesday). [[User:Polygnotus|Polygnotus]] ([[User talk:Polygnotus|talk]]) 13:40, 21 August 2025 (UTC)
= August 20 =
= AugustSeptember 251 =
== Estimating nodes in a tree for depth-first search ==
I need to traverse a large tree with a depth-first search. I need an estimate of the number of nodes to get an idea if it is feasible to do it. What I have in mind is to start the search but at each node, select one edge at random. Keep track of the branching factor at each level. Then repeat this maybe 10<sup>5</sup> times and get an average branching factor at each level. Then multiply the branching factors to get an estimate of the total number of nodes.
Should this give a reasonable estimate of the total number of nodes? [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 22:18, 1 September 2025 (UTC)
:If you know nothing about the tree in advance you will still not know, as the branches may go to any huge depth, including those branches you don't go near. Are you going to go full depth 10<sup>5</sup> times? That would give you some sort of probabilistic idea, but not any certainty. [[User:Graeme Bartlett|Graeme Bartlett]] ([[User talk:Graeme Bartlett|talk]]) 10:18, 2 September 2025 (UTC)
: <s>Do you have any way of knowing or estimating the total number of nodes? That in conjunction with your "branching factor" might give a better estimate.</s> —[[User:scs|scs]] ([[User talk:scs|talk]]) 10:48, 2 September 2025 (UTC)
::I think the point of the described sampling method is to ''obtain'' an estimate of the total number of nodes, to be used to determine whether a full traversal is feasible. ​‑‑[[User talk:Lambiam#top|Lambiam]] 14:44, 2 September 2025 (UTC)
:::Ah, yes. (And: "[[D'oh!]]") The emphasis on depth-first in the title had me assuming that the question was whether specifically depth-first traversal was possible, and the intent was to estimate the depth of the tree. —[[User:scs|scs]] ([[User talk:scs|talk]]) 21:24, 2 September 2025 (UTC)
:Assume you have a finite tree with a gazillion nodes that is completely linear: each internal node has exactly one child. With your method, you compute, each of these 10<sup>5</sup> times, the product of the branching factors as being 1<sup>gazillion</sup> = 1, which is not a good estimate. ​‑‑[[User talk:Lambiam#top|Lambiam]] 15:09, 2 September 2025 (UTC)
:: I was planning to go different random routes, each as deeply as I could, for enough trials to get an estimate. I picked 10<sup>5</sup> as an example. I could do more. The tree is largely unknown - I don't know how many edges a node has until I get to it, but the number of edges for each will be between 0 and 8. Very few paths will reach the maximum depth. The object is to get the path that goes to the maximum depth of the tree. [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 22:58, 2 September 2025 (UTC)
:::But if there is only one route, as is the case in a strictly linear tree with a branching factor of 1 at all levels (except for terminal nodes), a probe will produce 1, this being the product of the branching factors along its route. It does not matter if you run 10<sup>0</sup> probes or 10<sup>99</sup> probes – the answer is always 1, regardless of the depth of the tree.
:::Here is a mod to your algorithm. The number is computed in a variable ''E'' as you return in a probe backwards along the route from the terminal node to the root (which is easily coded if you use recursion; otherwise you need to fill and keep an array of branching factors). On returning from visiting a terminal node, ''E'' is set to the value 1. On returning from a visit to an internal node with ''b'' children, ''E'' is set to {{nowrap|1 + ''bE''}}. If the branching factors going down along the random route are ''b''<sub>0</sub>, ''b''<sub>1</sub>, ..., ''b''<sub>''n''−1</sub>, this computes, for the root node,
::::''E'' = 1 + ''b''<sub>0</sub> + ''b''<sub>0</sub>''b''<sub>i</sub> + ··· + ''b''<sub>0</sub>''b''<sub>1</sub>···''b''<sub>''n''−1</sub>''.
:::In the special case of a tree in which all nodes at the same depth ''i'' have the same number ''b<sub>i</sub>'' of children, this is the exact total number of nodes. ​‑‑[[User talk:Lambiam#top|Lambiam]] 00:07, 3 September 2025 (UTC)
:::You can also compute ''E'' directly going forward, using an extra variable ''P''. Initially, set {{nowrap|1=''E'' = 0}}, {{nowrap|1=''P'' = 1}}. When visiting a new node (the first of which is the root), set {{nowrap|1=''E'' = ''E'' + ''P''}} and then {{nowrap|1=''P'' = ''Pb''}}, where ''b'' is the number of children of the node. If the node being visited is terminal, we are now done (with this probe). Otherwise, move, randomly, one level down and repeat the process. ​‑‑[[User talk:Lambiam#top|Lambiam]] 00:16, 3 September 2025 (UTC)
:::: Thanks, I'll study this. There is certainly not only one route to a terminal node, but there might be only one path that goes to the maximum depth. But if there is more than one path that does get to the maximum depth, I'd like to get all of them. (I expect at most only a few of them. though.) (And I am using recursion.) [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 01:19, 3 September 2025 (UTC)
= September 2 =
== IssuesWhat withdoes Google''illegal'' andmean myin IPthe ___locationcontext of HTML? ==
To use it in a sentence (no pun intended), it's illegal to place a div inside an inline tag. – [[User:MrPersonHumanGuy|MrPersonHumanGuy]] ([[User talk:MrPersonHumanGuy|talk]]) 01:15, 2 September 2025 (UTC)
I've long ignored the discrepancy between google maps' blue dot ___location for me and my Google account address which they have. Now Google puts a weather report on my google news feed for that wrong ___location with no way to change its ___location or remove the useless report. I also have no way to disable or limit the AI mode overview which is unreliable and too often ends with me frequently correcting it only for it to forget even in the same sessions. I see that the ducky search engine allows for tailoring the usage of its AI. Bye bye Google search. But back to my question, Asking google how to stop automatically using my ip ___location which is about 80 miles away has gotten me absolutely nowhere. It has always been an issue with websites I visit and I have to enter my ___location, usually my zip code, because my browsers don't share it. I'll likely abandon the Google news page too now, unless there is an easy fix for this. Any idea(s)? [[User:Modocc|Modocc]] ([[User talk:Modocc|talk]]) 23:25, 25 August 2025 (UTC)
▲: TryIt non-communityviolates supportthe insteadspecs andof askthe yourHTML originalsyntax, question:is https://support.microsoft.com/en-us/contactusnot Shouldcorrect HTML, and may be liveexpected to cause renderers to behave chaterratically. [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 03: 2605, 162 AugustSeptember 2025 (UTC)
= AugustSeptember 263 =
| 