• 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.


  • Content count

  • Joined

  • Last visited

Community Reputation

653 Good

About DarrylStein

  • Rank
  1. Thanks for posting... very insightful
  2. Whats worse than losing your wallet? Finding it after reordering all your cards :(
  3. Think about how many options you have available per move (if the board is almost infiinite - then potentially you have almost an infinite amount of options), can those options be limited in some manner - are only a subset of them reasonable to inspect.  If you can answer those questions it may lead you closer to an answer on how to solve it.  For instance an almost infinite amount of viable options instantly rules out adversarial search like minimax/ab-pruning.
  4. The implementation that I used for genetic programming was representing the program as a tree.  Each node in the the tree had an INode interface with a method 'Evaluate( INode[] params)' Then I had concrete implementations of nodes for each of the different operators I wanted to represent   operator+ operator* sqrt while(...) if(...) and so on...   I also had a literal operator which just returned a bounded value which was generated randomly at instantiation of the tree (through initial creation or mutation) so at runtime I would create a concrete class through c# IL  e.g.   class literal5 : INode {      INode Execute(INode[] params)     {             return 5.0;     } }   hope that helps
  5. using System; using System.Collections.Generic; using System.Threading; public class ColumnPick { private static readonly Dictionary<int, int> NumberCount = new Dictionary<int, int>(); public enum Face { Zero = 0, One = 1, Two, Three, Four, Five, Six, Seven, Eight, Nine }; public static void Main() { for (int i = 0; i < 10; i++) NumberCount[i] = 0; const int maxIndex = 15000; var rand = new Random(); int oldHighest = 0; for (int i = 0; i < maxIndex; i++) { int next = rand.Next(0, 10); NumberCount[next]++; Console.Clear(); for (int j = 0; j < 10; j++) Console.WriteLine("{0}: {1}", Enum.GetName(typeof(Face), j), NumberCount[j]); if (NumberCount[next] > oldHighest) { oldHighest = NumberCount[next]; Thread.Sleep(500); } } Console.Write("Press any key to continue..."); Console.ReadKey(); } } I've simplified the code. Now to find the top x%, just sort the dictionary and take the top x% x 10 number of buckets.
  6. There are a few articles here that might be of interest. http://www.gamesbyangelina.org/  Maybe the Jul 20 one?
  7. One thing to look for when the AI is not taking the immediate win.  Is to see if the evaluation function discriminates between depth when it finds a win.  For instance, if a win is found at depth 2 and one at depth 5. It might choose the one at depth 5 which looks odd to a human - even if the win is still forced.
  8. Have you done any profiling on the code to see if there are particular areas that are bottlenecking?
  9. While there are multiple player versions of minimax (namely MaxN and Paranoid search), it doesn't handle simultaneous moves very well.  Past researchers have introduced an artificial ordering when simultaneous moves are needed, which has its own problems.
  10. wow - nice problem to solve.  I think minimax certainly will be useful as you start approaching the end of the game, for two main reasons. The branching factor reduces to reasonable numbers for minimax to handle well.  And there appears to be opportunity to use a quiescent search as it appears that many forcing moves will become apparent when there is an opportunity to block merging (or creation in a limited space) of groups (which I assume becomes very important near the end of the game).
  11.   Whilst this works with just straight minimax, it fails once you start implementing even simple search enhancements. i.e. it would be doubtfully useful with alphabeta and most likely useless with PVS
  12. Another possibility is to reduce the features in your evaluation function e.g. In chess a new player probably wouldn't understand concepts like passed pawns and outposts whereas a more advanced player would
  13. It appears that most of these are caused by interactions with other search enhancements.  Surely for the purpose of proving that an implementation is correct, you would disable these enhancements initially?
  14.   One thing I've done is to perform each search with TT on and TT off and then check that the same result is being returned.  The TT shouldn't affect the result (only in extremely rare instances) compared to a normal search - it should only affect the speed.
  15. Also consider that some games just aren't symmetrical (eg Fox and Hounds) and the evaluation will reflect that