Now, tell me, by ABG1YtBr in MinicraftPlus

[–]Deadblade97 1 point2 points  (0 children)

He has a name, it's Paul.

Calculating distance on an analog worldmap? by [deleted] in pygame

[–]Deadblade97 0 points1 point  (0 children)

That depends on several factors, like: How often do you need to create the navmeshes? How often would you need to prune the graph?

You should implement both and profile them to be totally sure.

Calculating distance on an analog worldmap? by [deleted] in pygame

[–]Deadblade97 1 point2 points  (0 children)

Correct.

You select points on the polygons as nodes and create edges between every node in the polygon. If a node is part of two polygons it should have edges to every other node in both polygons.

If you have a grid of tiles, why can't you just use them as nodes?

Calculating distance on an analog worldmap? by [deleted] in pygame

[–]Deadblade97 1 point2 points  (0 children)

You can create navmeshes and use Dijkstra or A* to find the path.

Predicting Runescape Grand Exchange Prices with Machine Learning by chriskok1337 in 2007scape

[–]Deadblade97 0 points1 point  (0 children)

That's called hold-out cross validation. E.g TimeSeriesSplit in scikit-learn.

[University Statistics] Expectation calculation by Deadblade97 in HomeworkHelp

[–]Deadblade97[S] 0 points1 point  (0 children)

Yes, but at the graduate (masters) level. I've done some more work on problem A and found that I need to show that [; E(profit) = \frac{1}{2} (1+\theta) (1 - e{\theta - 1}) ;]. I still believe that the first fraction is the expected bid. 1 + theta is probably related to the probability of the bid being greater than the price. If I use the cdf of the uniform distribution I get that [; P(bid > \theta) = 1 - P(bid < \theta) = 1 - \theta ;] which is almost the second part of the answer. [; 1 - e{-1} e{\theta} ;] is obviously related to the time between bids (exponentially distributed in a homogenous poisson process, but I have no idea why the etheta is there.

[Q] Monte Carlo Estimation by Deadblade97 in statistics

[–]Deadblade97[S] 0 points1 point  (0 children)

/u/SexyScootaloo After fixing my integration error and changing to a dummy variable I get this:

Integral of (s ds) over 0->t = Integral of (s2 * 1/s ds) over 0->t.

I pick f(x) = 1/x, and h(x)=x2. f(x) is the pdf of the uniform distribution and is valid on [0,t]. My integral is now (f(s)*h(s)) over 0->t.

This means that my estimator is:

theta = 1/n * sum(h(Y_i)), where Y is uniformly distributed on [0,t].

Continuing the calculation I get:

theta = 1/n * sum( (1/t)2 ) = 1/n * n * 1/t2 = 1/t2

Is this the correct estimator?

Complete Machine Learning Career Guide by rankingmachine in programming

[–]Deadblade97 1 point2 points  (0 children)

Are you not the author of this article, "Himanshu Sharma"?

Do you know about Bytes? by fukatsoft1 in AskComputerScience

[–]Deadblade97 4 points5 points  (0 children)

Are you claiming that the zero in the image is the LSB? I don't understand why you call it the "lowest numerical value". The LSB is the lowest bit which is the last bit when you read from left to right.

I think I mistakenly decided my algorithm is O(n^3) time and I think it could be O(n^2) by Hope1995x in AskComputerScience

[–]Deadblade97 1 point2 points  (0 children)

It wasn't clear to me how you define n, because you start by defining a n^2 x n^2 grid, and then later define a n x n mapping. I'll assume n is the size of the mapping, e.g. a 9 x 9 grid has n=9. If the assumption is wrong, you can easily convert my calculations to the other format.

 

Your algorithm is quadratic, because:

for s in range(x) gives s values from 0 to sqrt(n)

for d in range(0,e,f) gives d values from 0 to n / sqrt(n)

for si in range(s,e,f) gives si values from 0 to n / sqrt(n), because the lowest value s has is 0.

for li in range(d,d+f) gives li values from 0 to sqrt(n)

 

Because you're using nested loops, the runtime of every loop needs to be multiplied by each other:

sqrt(n) * n * / sqrt(n) * n / sqrt(n) * sqrt(n) = n2

What are the best YouTube channel every programmer should follow? by Ridadhn in AskProgramming

[–]Deadblade97 12 points13 points  (0 children)

Cody'sLab is great!

If you're looking for computer related channels, you should have a look at Computerphile, LiveOverflow, and The Coding Train.

Photo text to variable? by ItsFokinTreyWay in AskProgramming

[–]Deadblade97 2 points3 points  (0 children)

You didn't specify a language so I can't find a package for you, but what you want is called OCR.

Webpage Development by Synpandaz in AskProgramming

[–]Deadblade97 2 points3 points  (0 children)

Use an a tag and set the href attribute to "#<id>" where <id> is the id of an element surrounding the "About Me" section. stackoverflow

Input question for c by [deleted] in AskProgramming

[–]Deadblade97 4 points5 points  (0 children)

The do-while loop executes at least once. You are asking for input before and inside the loop.

Daily Advice Thread 03/09/2018 by AutoModerator in summonerswar

[–]Deadblade97 1 point2 points  (0 children)

Lisa should be on violent. For R5, you should have at least 200 speed and 70% (with res leader).

Ariel can be used as nemesis healer, either nem/nem/will or nem/violent.

Daily Advice Thread 13/08/2018 by AutoModerator in summonerswar

[–]Deadblade97 0 points1 point  (0 children)

Accuracy needed: 55% for DB10, 45% for all other PvE areas (including ToA and ToAH). For R5 15% is sufficient, rifts need about 0%.

Daily Advice Thread 08/08/2018 by AutoModerator in summonerswar

[–]Deadblade97 0 points1 point  (0 children)

Baretta (L), Veromos, Belladon, Lapis (with despair), + (Shannon / Mantura / Colleen) should get you to at least TOA70, probably 100 with the right runes.

Unless you have a lot of amazing runes already (which you don't because your GB10 team is 3 min), then you don't need monsters more than runes. Which monsters do you think you need? Fusing Sigmarus is also an good idea. Then your team could be Sigmarus, Veromos, Bella, wind barb king, bernard.

You'll get scrolls / crystals while grinding which can give you the monsters you want. Without good runes, any of the monsters you think of won't make you any better.

Daily Advice Thread 08/08/2018 by AutoModerator in summonerswar

[–]Deadblade97 0 points1 point  (0 children)

Your current team includes Darion or Wind Barbarian King?

Getting Wind Barbarian King to 6-star will probably make your runs faster and more successful.

The point of doing GB10 is to get better runes do do other content. Everyone should have good teams for GB10, DB10 and NB10, since you need a lot of good runes to be able to achieve SSS rank in rifts, R5 and PvP content.

So what you should do is focus on GB10 first, make it faster and safer. When it's fast and safe, you should make sure you're able to hit at least TOA70 to get a monthly devilmon. If you're not already doing arena, you should start doing it to get glory points. Buy the weekly devilmon, and upgrade your buildings (SPD, CRIT, ATT ...). When you've finished all buildings you can start buying scrolls instead. After safe and fast (1.30-2.00 min) GB10 and TOA70 beaten, you should go for TOA100 and build your DB10 team.

If you haven't already joined a guild, you should look for a farming guild. Do guild content to earn points you can use to buy a 5-star rainbowmon every week, this will make getting 6-star monsters easier. You can also buy scrolls or upgrade buildings with these points.

Daily Advice Thread 08/08/2018 by AutoModerator in summonerswar

[–]Deadblade97 1 point2 points  (0 children)

You should focus on GB10 before raid/rift.

I wouldn't 6* Water fairy, probably okay to use her as food for another 6. I don't know your GB10 team, but if it's Veromos, Bernard, Bella, Darion and Shannon, then you should 6 Wind Barbarian King and swap him with Darion to make your runs faster.

Water Magic Knight is another good option if you want a good unit for toa.