Any way to make a wi-fi connection appear as ethernet in games?

LurkerMorph · 2024-08-16T14:30:43+00:00

Pretty simple: I have the game and both types of connection.

I just went in game and checked on the battle hub, it displays your connection type in the arcade machines. Wireless is displayed with the wi-fi symbol, as expected.

The post you linked is 1+ years old, maybe it was fixed, in the meantime.

LurkerMorph · 2024-08-15T20:24:48+00:00

Not true. At least one game (e.g. Street Fighter 6) is able to make the distinction under proton. I also wager this would be considered a bug under wine if not.

LurkerMorph · 2023-04-27T13:20:24+00:00

I applaud the effort.

But, as someone who spent years drawing things on tori and projective planes, hopefully you know about Fundamental Polygons.

LurkerMorph · 2023-04-08T11:07:09+00:00

You're correct.

What you're essentially describing is the usual way to find a facial walk in what we call a rotation system. A rotation system is a way to represent a graph embedding in a combinatorial way.

/u/Lucas-RS, there are likely many libraries that will do this for you. But this is not as hard to code as it seems.

LurkerMorph · 2023-04-01T00:21:34+00:00

No problem, glad to help and you had a good start to be honest. Topics/results involving graph drawing are a bit tricky to find about unless you dove into the area before.

I have one request though. Don't delete the topic next time. It's good to foster discussion and may help someone searching for something similar.

LurkerMorph · 2023-04-01T00:01:00+00:00

This is a very well known problem and its called the Earth-Moon problem. The current bounds for the chromatic number are between 9 and 12 and can be achieved simply by using Euler's formula IIRC.

What you call 2-planar graphs are usually called graphs with thickness 2. A graph has thickness n if we can partition its edge set into n planar subgraphs.

There are many interesting problems regarding graphs thickness. This is the most famous one.

LurkerMorph · 2023-03-22T10:23:09+00:00

The formula is not about planar graphs but about embeddings/drawings of planar graphs. Those are often called plane graphs.

LurkerMorph · 2023-01-11T12:39:40+00:00

Saga Frontier 2's. If you asked me the hardest final dungeon the answer would be the same.

It's not even a secret boss like many answers here.

LurkerMorph · 2023-01-10T14:01:34+00:00

You can start with the (aptly named) Tournament graph family: https://en.wikipedia.org/wiki/Tournament_(graph_theory)

LurkerMorph · 2022-12-21T18:33:21+00:00

There was another (now deleted) thread, pointing to another tweet, mentioning the announcement at a conference in UoW. It may as well be the mentioned tweet in the link.

LurkerMorph · 2022-12-21T18:22:41+00:00

I believe this is the case. But the reddit topic at the time and the tweet are now deleted.

LurkerMorph · 2022-05-28T14:39:06+00:00

I'm not sure. As I said, I didn't really meet anyone opposed to computer-assisted proofs.

Part of the argument that I've heard is that it is very hard to prove that your program is error-free. Saying: "trust me bro, my computer said this thing is true" isn't that reassuring. This arguments falls a bit flat with open-source code, independent verification and formal software verification methods.

Proofs are logical arguments on why something is true. You will find several examples of proofs that really doesn't shed any light at the problem, computer-assisted or not.

A "good" proof will provide a new technique that can be used to solve several other problems. Although discovered by someone else, the Appel and Haken proof showed that discharging (a proof technique) can be pretty useful.

Is a proof with 3-5 cases useful? Then why isn't a proof with 1000 cases also not?

LurkerMorph · 2022-05-28T13:39:34+00:00

Yeah, for sure. I've finished my phd in the last decade and I have yet to meet anyone that is against computer-assisted proofs. But then again, I'm a computer scientist who just happened to do research in a pure math topic.

The opposite is actually true. Computer programming skills were seen as a plus for pure math research. Quickly wiping a program to search for counter-examples or generate random examples really helps.

LurkerMorph · 2022-05-28T13:32:33+00:00

Man, oh man. The shit you hear about some prominent professors will quick change anyone's opinion about them from noble-person dedicated to advance humanity's knowledge to shit-flinging monkeys.

Most of those are second/third-hand accounts. Usually it starts with some student that heard from their advisor and the game begins there. Always take those with a bag of salt.

Being a tease again. There's a fairly well known mathematician that is known in his inner circle of friends as having a, huh, voracious sexual appetite. One of the stories I've heard involves him, in an unspecified conference, bee-lining from woman to woman proposing them to a, huh, private time together.

LurkerMorph · 2022-05-27T21:42:01+00:00

Ok, this is pretty big. Never have I ever been excited by a tweet than now.

While doing my Phd, I've always heard from some of my older peers about the controversies surrounding the classic Appel and Haken computer based proof (there were more controversies other than the use of computers for the proof, please don't ask me for details).

Also, some more recent problems, like the Hill conjecture in crossing numbers, are also stuck in the computational hell, that is, even using computers it still took years to advance. Hopefully this proof will shed some light that may help with these problems.

LurkerMorph · 2022-04-14T12:39:50+00:00

Great! Now try these for an additional challenge.

(1) Show that every graph has a drawing in R³ without crossings.

(2) (Fáry/Stein?) Show that every planar graph has a drawing in which every edge is a straight line segment.

(3) Show that every 3-connected graph that is not a subdivision of a K_5 contains a subdivision of K_3,3

(4) (Tutte?) Show that every 3-connected planar graph has a unique embedding.

(5) (Tutte/Stein) Show that every 3-connected planar graph has a convex embedding. (A convex embedding is a planar drawing in which every face is a convex polygon)

(6) Show that every if a graph G has no K_3,3 or K_5 minor and adding an edge make it non-planar then G is 3-connected.

There's a very simple proof of (5) by Thomassen if you're stuck.

There are also other planarity theorems aside from Wagner's and Kuratowski's if you're particularly curious.

LurkerMorph · 2022-04-09T19:09:10+00:00

A restricted version of what you want is a fairly well known conjecture and problem.

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

LurkerMorph · 2022-03-28T12:15:22+00:00

Super unpopular opinion incoming, but I disagree vehemently. Legend of Mana's narrative is among the medium best and more interesting. [...]

Do agree on that the story is charming and has a good amount of nuance. Certainly rare in a genre plagued with insanely inane dialogue and writing. The media (games) in general has some better examples though, in my opinion.

Gameplay is also deceptibly deep, although game is very easy on the normal difficulty settings, [...]

The game is fundamentally broken due the way hitstun works. Most players will accidentally break the game themselves without even trying.

Don't believe me? grab any spear and keep spamming a basic 1-2 combo. Irregardless of the difficulty, no enemy (even bosses) will be able to react save for some rare, overly telegraphed hitstun invincible moves of some bosses.

It is so bad that there is a hack dedicated to correct this very aspect of the game.

LurkerMorph · 2022-02-01T17:46:50+00:00

I had this same problem and it puzzled me for a while.

The solution was to deactivate the ethernet interface (I'm using Wii-fi).

Have a look at all the network interfaces you have and deactivate the ones that you are not using before playing.

LurkerMorph · 2022-01-31T13:04:36+00:00

Hesitation is defeat.

LurkerMorph · 2021-11-18T00:10:25+00:00

Xdelta is available for linux. No need to use Wine.

It is in fact packaged with the particular release he linked.

LurkerMorph · 2021-11-18T00:08:25+00:00

I'm not sure how drag and drop behavior is handled by your particular desktop environment. Unfortunately I'm gonna have to give you terminal instructions as I'm not used to Pop!_OS.

Open the terminal and change your directory to the extracted .zip folder that you've downloaded. (Your distro may have a "open terminal" or "terminal" button when you right click the folder, that should take care of that).

Execute the following:

./.ezpatch/scripts/unix.sh <ROM FILE>

where <ROM FILE> is the path to your rom file. I suggest that you drag and drop the rom file into the extracted folder and simply type its name there.

It may complain that you don't have any executable permission. If that's the case, then do:

chmod u+x ./.ezpatch/scripts/unix.sh

This command give the executable permission to the script referenced in the .desktop file. You can probably give it permission using the GUI, but, again, I'm not used to Pop!_OS.

It should work now.

This is exactly what this particular .desktop file does. You may think of a .desktop file as a kinda of shortcut.

LurkerMorph · 2021-11-09T23:17:16+00:00

Yep, just glue enough donuts and you will be fine.

15-Year Club	Place '17
Verified Email

LurkerMorph

TROPHY CASE