minimax Questions
1
Solved
I'm confused with these two. is Negamax just an optimization for minimax? or is Negamax is another search tree algorithm? If negamax is another search tree algorithm, then which one is better?
1
let _board = [[null, null, null], [null, null, null], [null, null, null]];
let _flag = true;
let _AIrowIndex = null;
let _AIcellIndex = null;
const _wrapper = document.querySelector(".wrap...
Assertion asked 17/11, 2020 at 20:17
3
the description of the minimax algo says, that both player have to play optimal, so that the algorithm is optimal. Intuitively it is understandable. But colud anyone concretise, or proof what happe...
Isooctane asked 10/6, 2011 at 11:21
6
Solved
I'm writing a game that's a variant of Gomoku. Basically a tic tac toe on a huge board.
Wondering if anyone knows a good AI strategy for the game. My current implementation is very stupid and takes...
Baikal asked 5/8, 2011 at 6:59
3
Solved
The minimax algorithm is well described for two players for games like tic-tac-toe. I need to write an AI for a Tank game.
In this game the tanks have to move in a maze that have obstacles in the ...
Brockbrocken asked 12/2, 2013 at 6:5
1
Solved
Motivation:
I am trying to make a basic AI agent that can play chess against an opponent. The goal is to see how good it can become through the use of machine learning later on and also learn a th...
Homecoming asked 25/11, 2019 at 19:51
1
I'm writing an AI for the game 2048 using Python. It's going a lot slower than I expected. I set the depth limit to just 5 and it still took several seconds to get an answer. At first I thought my ...
Bookworm asked 17/6, 2014 at 4:59
1
When I check the value of "float.MaxValue" I'm getting:
3.402823E+38
which is:
340,282,300,000,000,000,000,000,000,000,000,000,000
Then why when I'm trying to set a much smaller va...
Eradicate asked 5/4, 2019 at 23:39
4
I'm making an AI for a chess game.
So far, I've successfully implemented the Alpha-Beta Pruning Minimax algorithm, which looks like this (from Wikipedia):
(* Initial call *)
alphabeta(origin, dep...
Bunton asked 13/11, 2013 at 3:11
1
Solved
Summary of my objective: Figure out how to use continuation-passing style to avoid a stack overflow when using an algorithm I believe cannot be made tail-recursive. Alternatively, find a way to mak...
Ungainly asked 29/3, 2018 at 21:32
1
Solved
I recently implemented Minimax and Alpha Beta Pruning algorithms and I am 100% sure that(autograder) I implemented them correctly. But when I executed my program they behaved differently. I am 99% ...
Airfield asked 8/11, 2016 at 17:19
2
Solved
I'm writing a program to play Dots and Boxes and I want to increase my time efficiency by ordering the moves I consider in alphaBeta based on their heuristic values in a iterative deepening scheme....
Magulac asked 20/1, 2017 at 5:3
1
Solved
I already posted a similar question here in this forum but since the old post got a little long and I rewrote my algorithm I'm starting this new post.
The old post can be found here.
So I'm simp...
Augie asked 27/7, 2016 at 15:18
1
I have created a Tic-Tac-Toe game on a microcontroller, including a perfect AI (perfect meaning that it doesn't lose). I did not use a minimax algorithm for that, just a little state machine with a...
Hengel asked 20/7, 2016 at 11:34
2
Solved
I am implementing a chess engine, and I have written a fairly complex alpha-beta search routine with quiescence search and transposition tables. However, I am observing a strange bug.
The evaluati...
Abbey asked 3/7, 2016 at 20:6
1
Solved
I am trying to implement a connect four AI using the minimax algorithm in javascript. Currently, it is very slow. Other than alpha-beta pruning which I will implement, I was wondering if it is wort...
1
Solved
I am implementing minimax in Python 2.7.11 in a basic game of Pacman. Pacman is the maximizing agent, and one or more ghosts (depending on the test layout) is/are the minimizing agent(s).
I must ...
Allegro asked 15/3, 2016 at 21:53
2
Solved
I'm writing a chess engine and recently added a transposition table.
When running a few tests, I found that although the search still returned the same best move, the value of the move (how good ...
Customer asked 22/12, 2014 at 16:4
2
I have to do a project where we need to implement mancala board game, and then also implement the AI for it.
We have been instructed that we need to modify or change a minimax tree to be able to w...
Amaranth asked 20/5, 2013 at 19:32
2
Solved
I have a basic implementation of alpha-beta pruning but I have no idea how to improve the move ordering. I have read that it can be done with a shallow search, iterative deepening or storing the be...
Kinson asked 1/4, 2012 at 12:46
5
Solved
I am trying to implement minimax with alpha-beta pruning for a checkers game in Java. My minimax algorithm works perfectly. My code runs with the alpha-beta code in place. Unfortunately, when I pla...
Qintar asked 16/3, 2013 at 9:20
2
Solved
In my method newminimax499 I have a minimax algorithm that utilizes memoization and alpha beta pruning. The method works normally for 3x3 games, however when I play 4x4 games I get strange, unexpec...
Monasticism asked 20/8, 2015 at 13:6
1
I've implemented a Chess game in C, with the following structs:
move - which represents a move from (a,b) to (c,d) on a char board[8][8] (Chess board)
moves - which is a linked list of moves with ...
Armada asked 14/8, 2015 at 16:35
2
Solved
I want to use minimax search (with alpha-beta pruning), or rather negamax search, to make a computer program play a card game.
The card game actually consists of 4 players. So in order to be able ...
Majuscule asked 30/9, 2012 at 23:46
5
Solved
I have spent a whole day trying to implement minimax without really understanding it. Now, , I think I understand how minimax works, but not alpha-beta pruning.
This is my understanding of minima...
Justiceship asked 25/10, 2011 at 11:44
1 Next >
© 2022 - 2024 — McMap. All rights reserved.