I am trying to calculate weights to use for a program that is using a minimax tree to search the best possible move for a board game.
I have a bunch of inequations that need to evaluate to true, each having 4 unknown values in them. One of these inequations look something like this:
25x - 3y - 5z + 3w > 29x - 1y - 7z + 2w
x, y, z, and w are all the changing values in my formula, and I can write out multiple different inequations like this, which should evaluate to true for me.
Is it possible, to find the value (or a range of values) of all unknowns in these inequations? If yes, how is this achieved?