934 karma · joined June 22, 2020
For example: https://railgallery.wongm.com/ev120-inspection-vehicle/F144_... https://www.youtube.com/watch?v=5TKDw2E_PBQ
Ah, the perennial dream of the technologist. Here's a Le Corbusier quote on the same theme from 100 years ago
> The cities will be part of the country; I shall live 30 miles from my office in one direction, under a pine tree; my secretary will live 30 miles away from it too, in the other direction, under another pine tree. We shall both have our own car.
My impression is that this isn't exactly settled science. If you look in the history for the article you can see that it's mainly written by the lead author of the main citations. He also did the cute illustrations that everyone loves
It's up the top at gitlab.example.com/help
>c++’s extremely convenient ‘auto’ keyword :)
https://www.reddit.com/r/Python/comments/w7vlim/i_made_a_pyt...
AT = Ta + 0.33×e − 0.70×ws − 4.00
where:
Ta = Dry bulb temperature (°C)
e = Water vapour pressure (hPa) [humidity]
ws = Wind speed (m/s) at an elevation of 10 meters
The vapour pressure can be calculated from the temperature and relative humidity using the equation:
e = rh / 100 × 6.105 × exp ( 17.27 × Ta / ( 237.7 + Ta ) )
where:
rh = Relative Humidity [%]
https://web.archive.org/web/20220203013548/https://www.thegu...
They submitted at 2022-02-03T03:09:31 [0] but this post got re-upped by the mods, as they sometimes do for submissions they feel deserve a second chance [1]
[0] as you can confirm by mousing over where it currently, erroneously, says "3 hours"
[['brung', 'waqfs', 'vozhd', 'cylix', 'kempt'],
['brung', 'waqfs', 'vozhd', 'xylic', 'kempt'],
['jumby', 'waqfs', 'vozhd', 'clipt', 'kreng'],
['jumby', 'waqfs', 'vozhd', 'pling', 'treck'],
['jumby', 'waqfs', 'vozhd', 'prick', 'glent'],
['jumpy', 'waqfs', 'vozhd', 'bling', 'treck'],
['jumpy', 'waqfs', 'vozhd', 'brick', 'glent']]
I was a little inspired by this thread [0] about the practicality of implementing brute force algs in pure python for solving wordle. Using only built-ins and with a bit of optimisation [1] it runs in 4 minutes single threaded in cpython.[0] https://twitter.com/eevee/status/1484716294179934209
[1] Instead of considering every possible combination, it discards non-optimal subsets. E.g. when considering o-words, only u- and a-word combos that already cover 10 letters are looked at. This significantly dampens the combinatorial explosion