?
Solved

Tic-Tac-Toe 4x4 - Evaluation Function

Posted on 2007-03-25
3
Medium Priority
?
2,228 Views
Last Modified: 2013-12-26
Hello,

When searching for a solution for  a 4x4 tic tac toe for a certain depth, how can I determine the utility if I haven't reached the last depth?

Can I write my own evaluation function, and it doesn't have to be "f(n) = [number of 4-lengths open for me] - [number of 4-lengths open for you] " since I'm not at the last depth.

I'll be using alphabeta pruning.
0
Comment
Question by:Serph
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 2
3 Comments
 
LVL 16

Accepted Solution

by:
AlexNek earned 800 total points
ID: 18788771
0
 
LVL 1

Author Comment

by:Serph
ID: 18824146
Thanks for the link, they were very helpful.

Still, trying to understand a 4 x 4 TTT to depth 3 where only 4 moves have been made, isn't easy!

I thought of an evaluation function= [number of 2-lengths open for me] - [number of 2-lengths open for you]

And using alphabeta, doesn't make it much easier either. (Too many nodes)

I still can't include all of it on a single excel or word document!
0
 
LVL 16

Expert Comment

by:AlexNek
ID: 18824745
If you thinking about function you'll possible want to find global max/min. In my opinion it is not a case.
I would try to find/prevent to create any 3x "opened" items. What I don't like in addition this is even /4/ size of win items. Normally we used only odd 3,5.
0

Featured Post

Learn how to optimize MySQL for your business need

With the increasing importance of apps & networks in both business & personal interconnections, perfor. has become one of the key metrics of successful communication. This ebook is a hands-on business-case-driven guide to understanding MySQL query parameter tuning & database perf

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Prime numbers are natural numbers greater than 1 that have only two divisors (the number itself and 1). By “divisible” we mean dividend % divisor = 0 (% indicates MODULAR. It gives the reminder of a division operation). We’ll follow multiple approac…
Performance in games development is paramount: every microsecond counts to be able to do everything in less than 33ms (aiming at 16ms). C# foreach statement is one of the worst performance killers, and here I explain why.
I've attached the XLSM Excel spreadsheet I used in the video and also text files containing the macros used below. https://filedb.experts-exchange.com/incoming/2017/03_w12/1151775/Permutations.txt https://filedb.experts-exchange.com/incoming/201…
Sometimes it takes a new vantage point, apart from our everyday security practices, to truly see our Active Directory (AD) vulnerabilities. We get used to implementing the same techniques and checking the same areas for a breach. This pattern can re…

649 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question