Are you willing to bet the stability of an entire language’s dependency ecosystem on that? Just so that we can write “crates.io” instead of “crates.rust-lang.org”?

That’s really the question. I do agree that there’s almost no chance it goes away as too many places and too much money depends on it.

I doubt they will too, but it’s still dumb that an entire package ecosystem now has to hope that ICANN will make another exception and special case .io

ICANN tried to phase out .su, the only reason they didn’t was because Russia was big enough to tell them no.

Forgot to mention .sh, which is also a ccTLD for a tiny island nation, and also shouldn’t be used for hosting anything that is difficult to move.

https://en.wikipedia.org/wiki/.sh

It’s definitely instance dependent. I run the servers for my instance at the closest Hetzner data center to myself (west coast USA) for latency reduction and over-size/engineer it for better perf.

My instance is open for registration too, if anybody reading here would find that useful.

That is a lot of effort to go through to avoid using a VPN.

That’s interesting, I heard of Cosmic recently but I haven’t had a chance to try it yet. I guess you’re liking it if you’re already building apps on it?

I’ve been slowly building a text based MMO game that I will probably continue working on this week: galactic-war

It’s based on Inselkampf, a very slow-paced game that I played years ago and wanted to play again. Inselkampf just started a new World this weekend, which it does every ~6 months, so I will probably end up working on my virtual clone of it this week while I’m thinking about it.

If you wanted to play too now would be a very good time to start. The userbase has continued dropping over the years it seems, with only a few dozen to a couple hundred players.

I also want to get releases and announcement posts out for a couple of my Matrix bot projects this week, pokem and chaz, but that’s been on the backlog for a couple weeks already

Hmm, I could have sworn I had code for this but I’m not able to find it. I wrote a DLX impl many years ago and used it for a few things, and I wrote several different sudoku solvers, but I don’t seem to have ever used my DLX impl to solve sudoku puzzles…

What you need to do is create a row for every possible entry and location in the puzzle. So you will have a row representing every single possible entry option. 9 options x 81 total squares = 729 total rows.

The columns in your Exact Cover Matrix represent all the different constraints, where each column must be unique in the solution.

• You’ll have 81 columns that represent just the location (you can only have 1 number in each of the 81 boxes).
• For every Row/Column in the Sudoku Puzzle, you will have 9 columns to represent the 9 different numbers. (e.g you can only have a single “5” in every Row of the Sudoku)
• For every 3x3 box in the Sudoku puzzle, you’ll also have 9 columns for the 9 different numbers.

So your Exact Cover Matrix will need 324 columns = 81 (squares) + (9 (numbers) * 9 (rows)) + (9 (numbers) * 9 (cols)) + (9 (numbers) * 9 (boxes))

When you fill out all the rows, you’ll place 1’s in all the columns that that specific entry aligns with. Take the example of the row corresponding to the entry “5” in the Sudoku Puzzles top left box. That row in your Exact Cover Matrix will contain:

• A 1 in the column representing that specific box.
• A 1 in the column that represents the number 5 in the first Sudoku Row.
• A 1 in the column representing the number 5 in the first Sudoku Column.
• A 1 in the column representing the number 5 in the top left Sudoku Box.
• 0’s everywhere else

To feed a specific puzzle into your solver, it kinda depends on the solver, you just need to force the output to contain those specific rows.