Epicmafia

groundhogdayalmost 9 years ago

https://www.youtube.com/watch?v=1ZnXhaAftBo

groundhogdayalmost 9 years ago

groundhogday

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

deleteddeletedalmost 9 years agoedited

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

deleteddeletedalmost 9 years ago

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

deleteddeletedalmost 9 years ago

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

Simsalmost 9 years agoedited

edit: that joke is not how i want to start page 18

Simsalmost 9 years ago

no i'm actually only 4'9''

Tatamialmost 9 years ago

But are you taller, Sims?

Simsalmost 9 years ago

i'm also smarter and more handsome, and i've banged way more chicks, on top of being better at mafia

Simsalmost 9 years ago

i don't care how good anyone is or was at this game, but i'm better than everyone here

deleteddeletedalmost 9 years ago

Diabolik

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

Niigga this shiit had me in tears

Tatamialmost 9 years ago

Recidivism

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.

Zeusalmost 9 years ago

Diabolik

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

what did you say about me

Diabolikalmost 9 years ago

who was winner main i cant remember elza could help

Tatamialmost 9 years ago

Quality post from Diabolik.

Third best player of all time is clearly Gerryoat.

deleteddeletedalmost 9 years ago

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.

Diabolikalmost 9 years ago

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

Tatamialmost 9 years agoedited

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.

deleteddeletedalmost 9 years ago

Just remember that you're in your ninth year on a mafia website rocking a Pokemon avatar as an adult when you post

Tatamialmost 9 years ago

Those are valid opinions to have and I am fine with you keeping them.

deleteddeletedalmost 9 years ago

Guy Clearly Unconcerned With Perception of His Intelligence

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.

deleteddeletedalmost 9 years ago

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

deleteddeletedalmost 9 years ago

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.

deleteddeletedalmost 9 years ago

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

Tatamialmost 9 years agoedited

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.

3rd best player ever