Would ask for the details about that water( quality , application and so on). Than I will offer them a cheaper source located near the destination. Doing such logistics would be absulutely stupid (Except for water of ultra high purity or large Deuterium/Tritium contents)
Fill it by a 12000km long 2cm wide tube. Do not underestimate the pressure needed to get a reasonable flow. Ever tried soak up honey with a straw?
In eastern Europe they are widely called “lying ploice man”
How would such a design look like? 1.8m width or do you gave examples?
The no1 browser to download other browsers
Not sure about the mailage of the voyager probes (wikipedia states a distance from death of 16billion mi) an they also have batteries with them. Does this count?🤔
Agree, grip of the lock-in is sitting tight … But as you mentioned, its less the lack of software than it is path dependencies.
In LibreOffice you can code marcos using Python. The actual problem is cross compatibility ( while its possible to execute VBA in LibreOffcie
Yes, this would work — but it comes with a subtle statistical bias: the character ‘W’ ends up underrepresented. With a naïve “avoid COW” approach, only about 25% of the grid will typically be ‘W’.
A more elegant solution would be:
That keeps the distribution much closer to uniform while still guaranteeing a valid puzzle. Then just insert the single “COW” manually wherever you want the hidden solution to be.
s= (320,180) #size
m=rand(['C','O','W'],s) #random init
c=1
while c>0 #iterate till solved
c=0
for i in 1:first(s)
for j in 1:last(s)
#check for 'COW' in each cluster of 3 and copy a character
#from a rendom cell to an other random cell of the cluster if found
if i>2 && m[i-2:i,j] ==['C','O','W'] #vertical
c +=1
r =shuffle([1,2])
m[i-r[1],j] = m[i-r[2],j]
end
if j>2 && m[i,j-2:j] ==['C','O','W'] #horizontal
c +=1
r =shuffle([0,1,2])
m[i,j-r[1]] = m[i,j-r[2]]
end
end
end
end
The neat part is that this preserves an almost perfectly balanced character frequency.
For comparison, the puzzle in the example image seems to contain roughly:
C: ~260 (~25%) O: ~520 (~50%) W: ~244 (~25%)
So the original author clearly used a different generation strategy.
Possibly on purpose: visually, ‘C’ and ‘O’ are much easier to confuse than ‘W’. Reducing the number of 'W’s therefore increases the search difficulty. In that sense, the approach suggested by @Snazz@lemmy.world is probably preferable: keep the distribution mostly balanced, but intentionally bias it just enough to make the puzzle psychologically annoying.
I wonder if there is a non iterative way to generate this puzzle with a ‘uniform’ character distribution 🤔
Next F35-frimware-dump on Piratebay:
[ RELEASE INFORMATION ]
-------------------------------------------------------------------
NAME......: F-35_Series_FW_Utility
VERSION...: v2.4.0-OPEN
DATE......: 2026-05-04
PLATFORM..: Embedded Linux / RTOS
TYPE......: Firmware Dump & Tools
SIZE .....: 14.2 GB (840x50MB)
ORIGIN....: Internal Flash (SPI/NAND)
[ DESCRIPTION ]
-------------------------------------------------------------------
This package contains a jailbreaked binary dump of the flight
controller. Included are scripts for:
* Hex-signature verification
* Partition table analysis
* File system extraction and flashing
[ INSTALLATION / USAGE ]
-------------------------------------------------------------------
1. Ensure your Fighter jet is in USB-Debugging mode.
2. Run 'python3 F35_jailbreak_flash.py --check-signatures'
3. Take Off
CAUTION: Modifying firmware can result in a bricked device
or "Fly-Away" scenarios. Use at your own risk.
[ GREETS ]
-------------------------------------------------------------------
To the researchers, the tinkerer community, and all those
who believe in the right to repair and modify their hardware.
-------------------------------------------------------------------
"Information wants to be free."```
Like to see the full statisticts, what’s the first and second kind error rates…