Wikipedia:Reference desk/Computing: Difference between revisions
Content deleted Content added
edited by robot: adding date header(s) |
|||
Line 5:
[[Category:Wikipedia reference desk|Computing]]
[[Category:Wikipedia help pages with dated sections]]
[[
</noinclude> = 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 =
== Which year American staté the bill on count ==
We need to know that year [[Special:Contributions/41.114.142.143|41.114.142.143]] ([[User talk:41.114.142.143|talk]]) 05:21, 20 August 2025 (UTC)
:I can't understand the question. ―<span style="font-family:Poppins, Helvetica, Sans-serif;">[[User:Panamitsu|Panamitsu]]</span> [[User_talk:Panamitsu|(talk)]] 06:41, 20 August 2025 (UTC)
:Are you sure this question is about computing, which includes information technology, electronics, software and hardware? Otherwise, please post it at a more fitting section of the reference desk. If the question is about history, politics or economics, the appropriate section is [[Wikipedia:Reference desk/Humanities|Reference desk/Humanities]]. Also, do not repost your question as it is now. Please rephrase it, so that we have a chance to understand the question. ​‑‑[[User talk:Lambiam#top|Lambiam]] 13:21, 20 August 2025 (UTC)
:Google AI says: The United States passed the Coinage Act of 1792, which established the U.S. dollar as the unit of currency and mandated that public accounts and court proceedings use this standard, making it the first "bill on count" in the sense of the financial unit. [[User:Shantavira|Shantavira]]|[[User talk:Shantavira|<sup>feed me</sup>]] 17:45, 23 August 2025 (UTC)
::{{small|I am unaware of ''[[wikt:count#Noun|count]]'' having a sense "dollar" (or any financial unit). ​‑‑[[User talk:Lambiam#top|Lambiam]] 13:09, 24 August 2025 (UTC)}}
:::<small>AI is aware of all sorts of imaginary stuff.</small> [[User:Shantavira|Shantavira]]|[[User talk:Shantavira|<sup>feed me</sup>]] 07:54, 25 August 2025 (UTC)
=
== 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)
: Do you have any way of knowing or estimating the total number of nodes? That in conjunctin with your "branching factor" might give a better estimate. —[[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)
= September 2 =
== What does ''illegal'' mean in the context 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)
:It violates the specs of the HTML syntax, is not correct HTML, and may be expected to cause renderers to behave erratically. [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 03:05, 2 September 2025 (UTC)
|