• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
stoneyrich

Implementing Transposition Table - NegaMax Search

2 posts in this topic

I am trying to implement a transposition table in my search incorporating zobrist key a brief description - at each position you have 13 different pieces, 1-6 from player 1, 1-6 from player 2, and 0 (empty) that means my zobrist key table will be of size 13 * 25. I filled my table with some random values wit the code below

public void intZobristKeys() {

Random ranZobristKey;
ranZobristKey = new Random();

for (int positon = 0; positon < 325; positon++) {
zobrist_table[positon][EMPTY] = ranZobristKey.nextInt();
zobrist_table[positon][PLAYER_ONE] = ranZobristKey.nextInt();
zobrist_table[positon][PLAYER_TWO] = ranZobristKey.nextInt();
}

}

am stuck where do i move from here as in the link between this and recording the actual moves in the transposition table eg {hashkey, state value, depth} etc any help ?
0

Share this post


Link to post
Share on other sites
First a minor detail: Things are a tiny bit simpler if you don't encode the empty squares in the Zobrist key.

Here are the things you are missing:[list]
[*]Add a member zobrist_key to your board description.
[*]Whenever the board changes (a piece moves, or is added, or is removed), change zobrist_key appropriately.
[/list]
[code] void add_piece(int square, int piece_type) {
// ...
// [[ Here goes your usual code to add a piece to the board ]]
// ...
zobrist_key ^= zobrist_table[square][piece_type];
}[/code][list]
[*]Create a structure TranspositionTableEntry that contains at least these fields: zobrist_key, depth, bound_type (exact, lower_bound, upper_bound), score, best_move.
[*]Create a large [fixed-size] array of those structures.
[*]Add code at the end of the search to store the results of the search in the table (the bound type depends on where the result falls with respect to the alpha-beta window). You'll need a replacement scheme to make sure you don't throw away important information, but you can start simply writing the results in transposition_table[zobrist_key%table_size], always overwriting whatever was there.
[*]Add code at the beginning of the search to look up the table and check if the zobrist_key matches. Then see if we can use the score (depth is high enough) to improve alpha or beta or to simply return it. If you still have to search this node (depth wasn't high enough, or the score wasn't exact and the bound improvement doesn't make alpha>=beta), you can still use the information of what move happened to be best or produced a beta cut last time we visited this position.
[/list]

Read up these links:[list]
[*]http://web.archive.org/web/20071214140939/http://www.seanet.com/~brucemo/topics/zobrist.htm
[*]http://web.archive.org/web/20080315233307/http://www.seanet.com/~brucemo/topics/hashing.htm
[*]http://chessprogramming.wikispaces.com/Transposition+Table
[/list]
0

Share this post


Link to post
Share on other sites
Hi alvaro,

Thanks soo much for your response and detailed explanation of my question.

I was able to implement the transposition table. and there was an improvement from my previous experiment.

Thanks once again...
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0