Perkun Wars optimal strategy

In the Perkun Wars there are three NPCs: Dorban, Pregor and Thragos. Dorban is a witcher, he is continuously hunting the vampire. Pregor and Thragos are humans - they are avoiding the vampire. You can attack the vampire whenever you see him, but it is the best idea to attack him when the NPCs are around.

There are two strategies: either you will hunt the vampire just like Dorban does (and thus you will mainly cooperate with Dorban) or you will wait with the humans till the vampire comes himself. The latter strategy is better - because the help of Pregor and Thragos is better than the help of Dorban. Very rarely you will be lucky enough to meet the vampire with all the three NPCs. This is your opportunity - attack him!

Perkun Wars

I have added a website for my game - Perkun Wars:

http://www.pawelbiernacki.net/software/perkun_wars/index_pl.jsp

This game is intended mainly for the developers willing to use Perkun AI library in their own projects.

Borsuk

I have published my new project - Borsuk. Not finished yet. You can download it from www.pawelbiernacki.net/borsuk-0.0.0.tar.gz

It requires SWI Prolog (devel packages), flex and bison. Just like Perkun it is also a library - libborsuk.

Take a look at examples/example2_fantasy.borsuk. It begins with declarations of classes and objects belonging to them, for example dorban is a person.

object dorban:person;

Then the variables (including hidden variables) can be generated with the templates like this one:

hidden variable has_(A:person)_(X:activity)_(B:person):boolean;

For each tuple (A,X,B) such that A is a person, X is an activity and B is a person it will generate the corresponding hidden variable. For example:

hidden variable has_dorban_attacked_pregor:{none,false,true};

As stated before borsuk will assume that the hidden variables are independent (or at least most of them are independent). This should allow Borsuk to support thousands of hidden variables, which was impossible for Perkun.

Independent hidden variables

I have an idea. Currently the problem is that the amount of hidden variables grows so that the amount of states becomes unacceptably large. I thought of decreasing the amount of states, or to be precise - I thought of assuming that the hidden variables are independent. It is not clear to me how this would work, but I started a project based on this idea.

A failure - "wydra"

I thought I would notify you about a project based on "bobr" called "wydra" (Polish for "otter"). The project was based on Prolog (to be precise - SWI Prolog) and looked very promising. Its purpose was to make optimal decisions just like Perkun does, but in the environment with very many hidden variables. I modified slightly the Perkun algorithm so that it only takes into account two hidden variables.

Unfortunately the project was a failure. I did not publish "wydra". It does not behave in the way I want it to. I thought you might wish to know.

aidreams.co.uk

I discovered a new AI forum. I have written about Perkun there: http://aidreams.co.uk/forum/index.php?topic=12889.0

One post is particularly interesting - it is about Perkun application for programming. You can download http://www.pawelbiernacki.net/programmer.zip. Then run:

perkun programmer_final.perkun

This message describes how to use it: http://aidreams.co.uk/forum/index.php?topic=12889.msg50969#msg50969.

AIHelsinki 27.9.2017: Pawel Biernacki