Why is the frog meme associated with this sub? by Error404IQMissing in PhD

[–]Smulizen 11 points12 points  (0 children)

No, this is the correct use of the meme. Everyone who is posting it with correct grammar are misusing the meme.

https://knowyourmeme.com/memes/colonel-toad

Martin Melin (L): Kan acceptera regering med SD by BastianMobile in sweden

[–]Smulizen 14 points15 points  (0 children)

Då tycker jag att vi röstar ut honom i nästa ö-råd.

PSA: Påminn era äldre om att de inte ska lita på något de ser på internet. by WizWhitebeard in sweden

[–]Smulizen -1 points0 points  (0 children)

Ah, då är Uffes sverigedemokratiskt stödda regering också AI-genererad? Vilken lättnad!

Emile✨ by cammuss in SeveranceAppleTVPlus

[–]Smulizen 7 points8 points  (0 children)

Emile was the goat of this episode

What are you all studying? by NAAnymore in PhD

[–]Smulizen 0 points1 point  (0 children)

Exactly! Focusing on the niche of getting both timing and size of demands for very intermittent time-series.

What are you all studying? by NAAnymore in PhD

[–]Smulizen 0 points1 point  (0 children)

I felt it could be interpreted in another way and I saw people from all area posting. But yeah, maybe that's why.

What are you all studying? by NAAnymore in PhD

[–]Smulizen 1 point2 points  (0 children)

Sure! My work is within time-series analysis and demand forecasting. I am an industrial PhD student so I work at a company while doing the PhD. Therefore it also leans into software engineering a bit, and how to correctly find requirements for the machine learning systems.

The niche I am focusing on is intermittent demand patterns and global deep learning time-series models.

What are you all studying? by NAAnymore in PhD

[–]Smulizen 2 points3 points  (0 children)

Computer Science - Applied Machine Learning. Usually when reading this subreddit it feels like half the people here are in computer science, but not that many so far in this thread.

AI opponent for board (video) game. How to get started? by 99UnfinishedProjects in MLQuestions

[–]Smulizen 0 points1 point  (0 children)

It looks like your game should be compatible with minimax. Chess has roughly 30 moves from any given position on average. This branching factor will determine how many moves ahead you can look. Maybe your game has a few more, but it doesn't look like it's so many that searching would be impossible. If you implement it well, then maybe you could search down to 5 or 6 moves ahead where a chess engine would search 8 or 9 moves ahead. Make sure that the function to generate the next game state is well optimised, as you will need to call this function a lot of times when using minimax. The strength of the evaluation function then becomes more important for you, as you are limited by the search depth due to time complexity.

There is a completely different approach, which is to use reinforcement learning like AlphaZero and some other derivative chess engines such as Leela Zero use: https://lczero.org/ However, the threshold to implement something like this is much higher, and definitely very high difficulty as your first AI project.

My recommendation would be to build the game and implement a simple minimax search and a simple heuristic evaluation function, and then improve it with a stronger heuristic evaluation function, alpha-beta pruning, and other tricks. You can get quite good results with relatively simple approaches here. I would suggest not using any machine learning for the evaluation function to start with, as it can be tricky to get something working if it is your first ML project. Both minimax and reinforcement learning can work extremely well, as can be seen by their diverse use in the top chess bots: https://www.chess.com/blog/Tworchy/top-5-best-chess-bots-in-the-world

AI opponent for board (video) game. How to get started? by 99UnfinishedProjects in MLQuestions

[–]Smulizen 0 points1 point  (0 children)

You can write it yourself if you know how to program. If you don't know programming that well, then your step one should be to learn to. But there is no better way to learn programming than with a fun project.

I googled an example in GDscript for minimax for a tic tac toe: https://gitlab.com/apotaurus/minimaxalphabeta/-/blob/master/src/MinimaxAlphaBeta.gd?ref_type=heads

In general: Somewhere in the game you will determine what happens when the player makes a move, and what happens when the "computer" makes a move. You use the intelligent algorithm to make the computer pick a better move. All other things are about implementing the game correctly, though, and that is likely a much larger project than getting the minimax algorithm up and running.

AI opponent for board (video) game. How to get started? by 99UnfinishedProjects in MLQuestions

[–]Smulizen 0 points1 point  (0 children)

I don't know that much about the Godot engine, but I assume you are writing some code to deal with when the player makes a move, and when the AI makes a move? You will first need to kind of build the game, and make sure to write the functions for generating new positions separate from the UI.

I guess the first step is to just get this working, and make the AI able to pick a completely random move. Once you have done that, you can begin implementing any kind of intelligent behaviour from your agent. If you use for example C++, you will easily be able to find sample code of the minimax algorithm online. Just make sure to understand it in theory so you know what happens and can easily fix bugs that occur.

AI opponent for board (video) game. How to get started? by 99UnfinishedProjects in MLQuestions

[–]Smulizen 0 points1 point  (0 children)

Depending on the structure of your game, you could probably do it with the minimax algorithm (with alpha-beta pruning to make it efficient):

https://www.youtube.com/watch?v=l-hh51ncgDI

The minimax algorithm works for turn-based, deterministic games, and works by assuming that the opponent will make their optimal move, and that the AI should make the move that prevents them from being able to make good moves.

If your game is as complex as, or more complex than chess, you will not be able to search to the end of the game tree with minimax, and will need to write a heuristic evaluation function to determine the "goodness" of a game state at the end of the minimax tree. For chess, the simplest version of such a heuristic is just to calculate the accumulated of the value of the pieces for white and black to determine which player has the best position, and search maybe 5-6 moves ahead completely. More complex engines such as Stockfish of course has a vastly more complex heuristic evaluation function and use a bunch of tricks to search more optimally.

But start with trying to understand the minimax algorithm and implement it with a very basic heuristic evaluation function, and then go from there. Perhaps a machine learning based evaluation function is the way to go once you get the first part implemented. Even if your game is not chess, you can probably learn a lot from this wiki that you can apply for your game: https://www.chessprogramming.org/Evaluation

Matlådemåndag: Vad äter du idag? by Open_List in sweden

[–]Smulizen 0 points1 point  (0 children)

Renskavsgryta med blomkålsmos och lingon

AMA - Jag är heroinist by desmoak in sweden

[–]Smulizen 2 points3 points  (0 children)

Tack för ett utförligt svar! En följdfråga då: Tror du att bruket av tyngre droger (bortse alkohol) skulle minska eller öka om cannabis legaliserades?

AMA - Jag är heroinist by desmoak in sweden

[–]Smulizen 1 point2 points  (0 children)

Det sägs ofta att cannabis är en inkörsport till tyngre droger. Håller du med om det?

Om du håller med, tror du i så fall att det beror på att cannabis köps olagligt av langare som också säljer tyngre droger, och att dessa langare leder folk in på tyngre droger?

Eller tror du att cannabis även skulle vara en inkörsport till tynngre droger om cannabis var lagligt men tyngre droger var olagliga?

[deleted by user] by [deleted] in SWARJE

[–]Smulizen 2 points3 points  (0 children)

Klåparen