Yeah, if its all open source I guess there's not much value in selling it. Since the value of your site is all in you knowing how to actually run and operate it.

and the playerbase who I assume will follow me to something similar when I get around to making it. Have a couple ideas but people keep giving me more to do on this ugh. 145 open issues.

Playing poker, would like to configure and play HU NL against DeepStack, and also use the same Deep Learning algorithm for limit hold'em and mixed poker.

https://www.deepstack.ai/

If anyone else is interested in playing DeepStack HU, PM me. The programming languages are Ruby (for the GUI), C, Lua, and Torch as well as some basic scripting. It takes full advantage of Deep Learning algorithms. Dustin Morrill's code is excellent, but it's not so easy to decipher. The algorithm is limited to HU because of mathematical reasons that I don't fully understand.

Side note: There's a new book from the University of Alberta on reinforcement learning. It's in it's final draft. It's a little beyond my comprehension, but fascinating stuff. Self-driving cars here we come.

https://drive.google.com/file/d/1xeU...j2C7aAFWY/view

I am planning on taking computer science courses, finishing my two-year, find a deep learning college, and perhaps go into the AI field for contract work. Playing against model poker is ideal for poker lessons.

I don't have much time, but I'm interested in this, and have been getting into deep learning.

From the deepstack.ai site, it looks like they've released the code for leduc poker, but not their HUNL code. Were you planning on taking the leduc code and extrapolating it to reproduce their HUNL work? Would be an interesting project, but very challenging I'd imagine.

I don't want to do a code upheaval. I believe it's possible to do the DeepStack algorithm by changing some configuration files, and train DeepStack on HUNL instead. It's only configured for Leduc. It would, however, take significant code changes to alter DeepStack to do limit poker, or mixed games poker, because that would take more than just configuration. So, I want to get the most poker knowledge for the least time, so the project I am thinking is playing the bot heads-up and OpenSource an analysis tool so you can do post-game analysis.

I'm either going to work on this or find something in RL, because I see self-driving cars and robots making decisions. Automakers are going to make Rosie. I should perhaps find something related to that.

got a code golf problem for you guys

term frequency counter, where we want the top 25 terms in a text file, with a list of stop words to not include. the text file is read from command line and stop words are contained in a .txt file as well

can't use python, c++, ruby, scala, or clojure

I have a pretty hilarious java solution.

shield your eyes (graded on # of chars, I got ~1100 which is pretty decent i think)

the readable solution was ~20ish lines

Am I JavaScripting correctly? Without being a full solution (assumes input is passed rather than adding a couple lines to read the files), this is (kind of) a one line solution and is 296 chars not including the added-for-readability comments: (also I didn't actually try running it so something's prob broken)



There's probably a 1 line way to do the code inside the reduce(), I still have a lot to learn before I can write my entire programs in one line

8 space tabs itt

#!/usr/bin/perl
$e="the it";
$d="the quick brown fox quick fox fox brown it jumped";
while($d=~/(\w+)/g){if($e!~/$1/){$c{$1}++}}
foreach$n(sort{$c{$b}<=>$c{$a}}keys%c){print"$n $c{$n}\n"}

fox 3
quick 2
brown 2
jumped 1

Learn to use java streams, imo. I haven't tested this or bothered with the reading from input/from file. Have fun scrolling horizontally!

Will break if there's punctuation, be a pretty easy fix tho (change the regex. too lazy). I'd say the entire thing (reading from file etc) can be done in one line, minus exception handling.

Well for starters, you've used the Enter key a few times there, that's a no-no.

Oh that’s way different than mine. My first instinct was to implement comparable on a class that stores the string and its frequency because hash map solutions are really messy and disgusting

I thought of that after I posted. As well as words like don't.

If you see a HashMap, it can be easily dealt with via the first rule of Java Club: Immediately convert all streamable objects into streams.

Rule 2 is: Basic Strings are occasionally exceptions to Rule 1.

The word "DON'T" was definitely coming to mind while writing the above monstrosity.

Chris - i may mess around with it later but I had to be extremely careful with how I decided to do things because the file we're parsing is pride and prejudice which is an extremely large book and has about ~11,000 unique words.

For instance, I learned the hard way (I had forgotten) that Strings are immutable in java. So yea, str = str+= "text" destroys and creates a new object each time. Good way to throw a outOfMemoryError which I've never even seen. Gotta use StringBuilder if you want to build a really large string.

I've been coding a ****load of C in my other classes and the result is, after years of being a java devotee, that I think java sucks ass. This Frequency Counter program really brought me to my knees.

The class takes a few different programming styles and has you re-implement the frequency counter in a different way each week, which is cool. But sometimes it makes me have to use some features of the language that are just annoying.

When something goes wrong in C, or even C++ for that matter, it's almost always gonna be my fault. When something goes wrong in java, who ****ing knows. Reading documentation and stackexchange to figure out how exactly they implemented a certain class is just so tedious. And then there's all the weird java trickery involved to do things that may seem pretty easy - yea right, try sorting a HashMap by its values.

Then I learn hashmaps actually ****ing suck. ConcurrentModificationExceptions whenever you try to modify an object that you're iterating through in a for:each loop is ****ing annoying and I had forgotten about that. HashMap<E> hm = new HashMap<E>(other hashmap) straight up doesn't work sometimes. Having to implement your own hash functions, etc. etc. Oh yea, on my own machine I was able to create an anonymous object for my subclass even though i did not declare a default constructor - on the school's unix cluster it threw a ton of exceptions and i had to declare a blank constructor. so much for compile once run anywhere.

My actual breaking point is that there is NO ****ING TUPLE in java. Like that would've simplified the problem so much. Every single other language has it or some super easy way to recreate it - but no, I have to declare my own subclass and implement comparator to get it to work with my program, or include a separate file. Either that or use SimpleEntry in a super strange way that was definitely not intended.

Just such a ****ing pain in the ass. It does some things really well - it's probably always my go to language for any problem involving parsing, because java streams are just so good and Scanner is a truly amazing library. But everything that goes along with it just made me rage hard today, having to learn so many stupid things the hard way wasted me about 3 hours I really could've used working on other stuff. It creates SOOOO many objects and uses so much space to do the simplest things, it's insane.

Rule 1 of Java Club.

Java is the ****ing worst. I come from C#, which is like Java that is actually intuitive, is richly-featured and works, so coming to Java is like getting downgraded from power tools to a hammer and chisel. Java streams are a hell of a lot better than having no functional programming at all, but LINQ in C# is about a zillion times better. The main problem with Java streams is that they are unintuitive and the errors are all utterly incomprehensible. For instance, if I try to assign the result of the above to a HashMap<String, Integer>, everything is fine. But if I try to assign it to, say, a List<String>, this is the result:

OK, something about incompatible types, no big deal, we'll just mouse over the toMap and see what type it produces...



Oh.

In C# it will just go "yo, this produces a Map<String, Integer> and that's not what your variable is". I don't get why it's hard, but Java streams always error out with total nonsense and I have to go google for what I'm doing wrong.

My favourite piece of Java hate, which I've posted before ITT, is that there's an Arrays.toList() method, which takes an array and produces an ArrayList. Easy! Except that this ArrayList is not a java.util.ArrayList, but a java.arrays.ArrayList, which looks and acts exactly the same unless you try to mutate it, in which case it will compile and then throw an exception at runtime. I consider this proof that the programmers of Java actually were trolling us.

you didn't get much feedback but this looks pretty good other than I have never used Object.values in my life and its relatively new so uh not sure what you're doing there but maybe consider something else. Not that its wrong.

seems halfway there (not handling stopwords) and easy enough to slot in punctuation and whatever other refinements.

Curious if anyone on here has much experience deploying and developing on windows platforms. I have an interesting opportunity presenting itself and I’m not sure if I want to take advantage of it or not. Just have a few questions I’d love to ask via pm.

TIA

At a glance...

Seems very inefficient. As a rule of thumb, never use remove() or contains() on an ArrayList, unless you know for fact the size is small (< 10 items).

Also, names should be descriptive. It's not clear what `pi` does just by looking at its name, and why it's called multiple times.

Program flow should be:

1) Dump stop_words into a hash
2) Iterate through words file. Skip if word present in stop_words, else initialize/update count.
3) Dump hash key/values in an array. If the array's size > 25, sort it by values.

I see the board game on Amazon. What events led you to decide to turn it into an online game?

But it's all one statement (except the lambda in reduce()), don't hate because I made it readable.

What's standard to accomplish what Object.entries does, something like

Object.keys(arr).map(key => [key, arr[key]])

?

oh if you absolutely must iterate through the values of an object/assoc. array Object.entries is perfect obv but its basically never happened to me where I need to be like "oh I have this object and I need to perform x on all of its values and make something new out of that" which makes me wonder wtf you're doing or your api dev is doing but again I can't imagine its really that bad if you need to do it. There's (probably?) a reason Object.entries was made. I abuse the **** out of Object.keys frankly i.e. I could probably do it better.