2 Replies - 290 Views - Last Post: 28 February 2018 - 08:55 AM

#1 bobsmith76   User is offline

  • D.I.C Head

Reputation: 9
  • View blog
  • Posts: 211
  • Joined: 14-February 17

does this problem have a name?

Posted 27 February 2018 - 09:12 PM

You know how in chess you can't check all of the possible moves but have to identify dead-ends and not explore them? Does that problem have a name in computer programming? I'm running into that problem with my own software but I don't want to rename the problem. I also can't call it the relevance problem because that name has already been taken in logic which is the field I'm working in.
Is This A Good Question/Topic? 0
  • +

Replies To: does this problem have a name?

#2 baavgai   User is online

  • Dreaming Coder
  • member icon


Reputation: 7181
  • View blog
  • Posts: 14,969
  • Joined: 16-October 07

Re: does this problem have a name?

Posted 28 February 2018 - 05:27 AM

The magic word you're looking for is "heuristics." While a general term, in strategy game design it is favored to the point that a google of "game heuristics" will send you down the right rabbit hole.

Indeed, Wikipedia has a neat entry that will also highlight various pruning strategies, etc: https://en.wikipedia...iller_heuristic
Was This Post Helpful? 0
  • +
  • -

#3 bobsmith76   User is offline

  • D.I.C Head

Reputation: 9
  • View blog
  • Posts: 211
  • Joined: 14-February 17

Re: does this problem have a name?

Posted 28 February 2018 - 08:55 AM

Thanks I really appreciate that.
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1