How to use automated planning to play a Warhammer 40k game
In older posts we have seen how to solve a problem of selection, using different Computer Science techniques. Today, I would like to start a new series of posts using a different Artificial Intelligence technique to play a game, in this case as you know, we focus on Warhammer 40K. Since this is a very large subject, I wanted to divide it in several posts. The idea is to first introduce a bit of theory today (but don’t worry!), …
Create a good selection using a search problem
I wrote a post last week about using Genetic Algorithms to select troops for a Warhammer 40K game. That post was part of a series of posts about the problem of the best selection (you can read them here, here and here). I wanted to change the focus from that problem to search algorithms and how important are they for Artificial Intelligence. But a friend of mine noted that Genetic Algorithms could also be transformed into a search problem. …
Using Genetic algorithms to create a Warhammer 40k army
In the last post, we explained how to select an army of Warhammer 40K (W40K) using Linear Programming (you can read it here), but there was one thing I did not explain, and I promised to adress in the next post: how selecting some units might affect others. For example, in W40K, selecting a good HQ unit grants benefits, like extra dice rolls and increased chances of hitting the enemy. It is absolutely possible to express this in Linear Programming by adding extra restrictions and modifying the objective function. However…
Creating a Warhammer 40k army using Linear Programming
Last week I wrote a small article where I showed how to use the Python PuLP library to solve a Linear Programming problem (you can read it here). After writing the article, I was wondering if I could use the same script to solve more problems while also providing more examples of Linear Programming, and I decided to model what I consider an interesting problem that I call the Best selection problem (don’t search, I invented it!), …
A minimal example of Linear Programming in Python using PuLP.
I have recently moved to a new apartment, so I needed to buy new furniture and appliances. Usually before buying, I study the best price in sites like Zoom or Buscape (here in Brazil), and then buy the best offer. But these days, due to the pandemic in Brazil, I am also thinking of using different online shopping applications for the everyday shopping, meat and groceries.
And, how can we minimize the cost in this case? This is not trivial, because we may have multiple shops, offering multiple products…
I am a Über nerd, interested in Robotics, Machine Learning and Computer Science in general, as well as Entrepreneurship.