-
as seen on Game Development
- Search for 'Game Development'
I've implemented Negamax as it can be found on wikipedia, which includes alpha/beta pruning.
However, it seems to favor a losing move, which should be an invalid result.
The game is Tic-Tac-Toe, I've abstracted most of the game play so it should be rather easy to spot an error within the algorithm…
>>> More
-
as seen on Super User
- Search for 'Super User'
The main reason I even started participating on Superuser.com is because a friend ripped me a new one for using phpBB. He said, "check out StackExchange, they have their act together!" I did, and it's true. So now, after learning phpBB and implementing the board (it's still new and in its infancy)…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi, I'm stuck on the extended exercise 28.2 of How to Design Programs.
Here is the link to the question: http://www.htdp.org/2003-09-26/Book/curriculum-Z-H-35.html#node_chap_28
I used a vector of true or false values to represent the board instead of using a list.
This is what I've got which doesn't…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
main.m
counter = 1;
n = 8;
board = zeros(1,n);
back(0, board);
disp(counter);
sol.m
function value = sol(board)
for ( i = 1:(length(board)))
for ( j = (i+1): (length(board)-1))
if (board(i) == board(j))
value = 0;
return;
end
if ((board(i) - board(j))…
>>> More
-
as seen on SQL Team
- Search for 'SQL Team'
PASS launched a Global Growth Initiative in the Summer of 2011 with the appointment of three international Board advisors. Since then we’ve thought and talked extensively about how we make PASS more relevant to our members outside the US and Canada. We’ve collected much of that discussion in our…
>>> More
