Back to Epicmafia

3rd best player ever

deletedabout 7 years

no.1 and 2 is obviously between maxwell and myself (i'm no.1)

poll includes the top candidates for the next best.

who's the better player
6
Crypto
6
Gira
2
Fantastic
2
Soben
1
Jaguar
groundhogday
about 7 years
https://www.youtube.com/watch?v=1ZnXhaAftBo
groundhogday
about 7 years

groundhogday says

this thread would go good on reddit.com/r/iamverysmart

deletedabout 7 years
Lastly, if you want to think about the Queens problem from a P=NP perspective, click the help button on the site that solves it for you, then spend the short time it takes to look and verify that the solution is correct. Even if you essentially brute force checking if the solution is correct (aka just looking at each queen and verifying that there is no other queen on the same row, column, or diagonal plane) then you will have still probably spent like 15 seconds tops, P=NP is claiming that you can write a program that can solve the problem in an equally short amount of time that it takes to verify the solution (a program would take minuscule fractions of a second to verify this) so think about how quickly it would take you in comparison to solve that over and over
deletedabout 7 years
Also Sonseray, just because people are working on it doesn't mean that they think it is possible. It's generally regarded that P most likely doesn't equal NP and people are working on the problem not because they think it's true, but rather just to find a solution. The prize will be handed out to anyone that can disprove P=NP as well
deletedabout 7 years
I feel like some people here don't understand what the core of P=NP is actually about

it's not explicitly about solving the problem "efficiently," it's about how quickly a solution for a problem can be found in comparison to how fast its solution can be verified
Sims
about 7 years
edit: that joke is not how i want to start page 18
Sims
about 7 years
no i'm actually only 4'9''
Tatami
about 7 years
But are you taller, Sims?
Sims
about 7 years
i'm also smarter and more handsome, and i've banged way more chicks, on top of being better at mafia
Sims
about 7 years
i don't care how good anyone is or was at this game, but i'm better than everyone here
deletedabout 7 years

Diabolik says

i plce first . 3 zeus fruit and winner not the winner who is now but the original


Niigga this shiit had me in tears
Tatami
about 7 years

Recidivism says

It's too bad that the self-reflection is only a front to make yourself look good to epicmafia people, you could do with some self-reflection.


I think you're right that I need to do some, given what I did to you in this thread.
Zeus
about 7 years

Diabolik says

i plce first . 3 zeus fruit and winner not the winner who is now but the original


what did you say about me
Diabolik
about 7 years
who was winner main i cant remember elza could help
Tatami
about 7 years
Quality post from Diabolik.

Third best player of all time is clearly Gerryoat.
deletedabout 7 years
It's too bad that the self-reflection is only a front to make yourself look good to epicmafia people, you could do with some self-reflection.
Diabolik
about 7 years
i plce first . 3 zeus fruit and winner not the winner who is now but the original
Tatami
about 7 years
I do remember.

I'm not really going to engage you on anything from here because I really baited you maliciously for my own humor, and that was really, really wrong of me to do, and I'll apologize. I'm going to leave it at that, and I'm not going to fight whatever assertions you make about me. I think they're all valid viewpoints.
deletedabout 7 years
Just remember that you're in your ninth year on a mafia website rocking a Pokemon avatar as an adult when you post
Tatami
about 7 years
Those are valid opinions to have and I am fine with you keeping them.
deletedabout 7 years

Guy Clearly Unconcerned With Perception of His Intelligence says

The N queens problem is a type of problem in computer science and mathematics that is classified as NP, specifically "NP-complete", a certain complexity class with the implication that if you can find an algorithm (in polynomial time, tl;dr efficient time) for a single problem in that set, it means that it is possible to find one for any of them. The short of NP problems is that it is computationally difficult to find a solution but easy to verify them if you have one-ex. if you have a 1000x1000 board with 1000 queens, it's super easy to verify the solution-but how do you find one quickly?

This is in comparison to a complexity class called P which is easily computable and solutions found pretty simply. If there's an efficient algorithm for it, it's in P.

The biggest question in modern computer science is does P=NP or are they two entirely classes?

What you're aiming for in this N queens problem is finding an algorithm for a problem that is certified NP-complete, with the definition of NP-complete again meaning that if you can find an efficient algorithm for a single NP-complete problem, not only is that problem in P, but so are all other NP problems.

The consensus of most computer scientists and mathematicians is that it is very likely that P does not equal NP, making such an efficient algorithm literally impossible.

deletedabout 7 years
Please tell me that it doesn't matter whether or not people think you are smart, guy who has typed me essays on the theory of the children's party game mafia
deletedabout 7 years
Here is some psychoanalysis for you:

I think it matters to you that you are perceived as smart more than anything else, and I don't think you are smart at all. Average at best.
deletedabout 7 years
Do you know what I think? I think you spent the past hour and a half arguing with me about your intelligence because you get really hot and bothered if someone doesn't think you are as smart as you think you are
Tatami
about 7 years
Like, the original argument was a lot but was actually about something, this was just me trolling you which was wrong of me so I'll apologize.

I'm sorry for doing that.