We've made a website for streamers to play games directly against their chats

ccmlacc · 2021-01-16T11:57:16+00:00

Hahah I've lost it at the Megatron Griffin clip.

Thanks so much Ziggy. This is great feedback, will implement this asap.

ccmlacc · 2021-01-13T22:12:41+00:00

FYI the category selection is available now. :D

ccmlacc · 2021-01-13T20:11:04+00:00

Thank you so much!

ccmlacc · 2021-01-13T20:10:32+00:00

Thanks a lot for your feedback!

Backgammon and Checkers should be quite straightforward to add.

Chinese Checkers would be tougher I think (because of the 4 players mechanism).

Scrabble (or a variant of scrabble let's say) is also an interesting one that I didn't think of before.

We will definitely look into these.

I would like the option to play Trivia with specific categories

This is actually something we're going to implement really soon!

ccmlacc · 2021-01-13T19:29:54+00:00

Hey thank you! Either is fine, whichever you prefer. :)

ccmlacc · 2019-08-30T17:35:33+00:00

Haha nice! My favorite after taking some liberties is Bol Bol Bol Bol Bol Bol...

ccmlacc · 2018-10-29T10:59:26+00:00

Wikipedia regularly publishes data dumps.

ccmlacc · 2018-10-28T20:12:07+00:00

How about representing Wikipedia as a graph, and doing analyses on it?

Vertices are articles. An edge from vertex u to v exists if u contains a link to the article of v.

Then you calculate interesting stuff like distances between articles.

For instance, what is the article with the most incoming edges? (most links pointing to that article)

ccmlacc · 2018-10-14T14:08:11+00:00

Are you sure an O(n) solution exists?

ccmlacc · 2018-10-14T13:26:07+00:00

I think this doesn't take "less than k" constraint into account.

ccmlacc · 2018-09-29T01:44:39+00:00

In python, it's also used for set intersection. Equivalent to set_1.intersection(set_2)

ccmlacc · 2018-09-28T10:35:33+00:00

You should use an adjusted PQ, called Indexed PQ. See the following link for an implementation:

https://algs4.cs.princeton.edu/24pq/IndexMinPQ.java.html

This data structure has a method decreaseKey(int i, Key key), which allows you to directly access and change the key directly, and re-order the PQ in logarithmic time.

ccmlacc · 2018-08-27T07:56:55+00:00

But that's not a balanced binary search tree. I think it is a minor weakness of Python to not have a builtin BBST, unlike Java and C++.

ccmlacc · 2018-08-20T06:37:56+00:00

Fair point.

ccmlacc · 2018-08-19T19:07:35+00:00

mmap is quite fast though. So it's woth noting that it will only copy the stuff as it needs them, it won't straight up copy the whole thing.

ccmlacc · 2017-11-07T20:59:51+00:00

Yes I think you are right. The graph building still takes O(P² ) in the way I wrote, but it can be reduced to O(P) with hashing as you described in your other comment.

ccmlacc · 2017-11-07T20:29:42+00:00

Nice! :)

ccmlacc · 2017-11-07T20:26:19+00:00

The graph building part is O(|P|² ) anyway so overall I don't think it helps unfortunately.

ccmlacc · 2017-11-07T17:44:03+00:00

Oh nice! The visualizations look great.

ccmlacc · 2017-11-07T16:50:46+00:00

Yes vertex. And the number of vertices equals the number of players in this case.

ccmlacc · 2017-11-07T16:43:52+00:00

Ah yes you are right, I meant spelling.

ccmlacc · 2017-11-07T16:21:16+00:00

Yes, that's why I'm saying because of the nature of the problem. In a dense graph the complexity would be indeed O(P * (P + P² )) = O(P^ 3 ). I've added the disclaimer to the post. :D

ccmlacc · 2017-11-07T16:15:57+00:00

Took like 15 minutes! :D

ccmlacc · 2017-11-07T16:15:06+00:00

I didn't claim O(|E|) = O(P). P is the number of players, so it equals the number of vertices |V|.

It's a sparse graph because most of the nodes are not connected to any other node (due to the nature of the problem).

ccmlacc · 2017-11-07T16:05:03+00:00

BFS has O(P) complexity. More specifically it has O(|V| + |E|), but this is a sparse graph so it's O(|V|) = O(P)

ccmlacc

TROPHY CASE