Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author | user:1234 user:me (yours) |
| Score | score:3 (3+) score:0 (none) |
| Answers | answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections | title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status | closed:yes duplicate:no migrated:no wiki:no |
| Types | is:question is:answer |
| Exclude | -[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithm
Search options not deleted user 9284
Algorithms are used for calculation, data processing, and automated reasoning. More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
2 votes
tic tac toe computer opponent
For games like tic-tac-toe (broadly speaking, 2 player board games), the usual method is to try all possible moves, and rank them. Obviously winning moves would rank best and losing moves worst. Bet …
1 vote
Algorithm/ Logic of identifying a circle in Go game
Instead of trying to recognize the circle, recognize the islands. Every island is enclosed by a circle.
0 votes
Is it better to hard code data or find an algorithm?
Q: is this the only hex game you'll ever write? No? A: Then obviously you should try to be flexible wherever it doesn't cost you a lot of extra effort. Regardless how you define the board, represe …
1 vote
Repetition of move in Draughts game
It's pretty common for robots to prefer meaningless to-and-fro moves in games that permit them, and in situations where there is no immediately obvious good move. There's nothing wrong per se; but fi …
0 votes
Accepted
Static evaluation function for Checkers using Minimax
The duplicate values are to be expected, since you're only "counting the wood". Augment your heuristic to include additional features, for example you might count the average distance to the center, o …
1 vote
Accepted
Finding next AI move using MinMax algorithm for Checkers
The usual implementation for this is to have only a MaxMove function, and negate the value returned. You only need to remember the top level move, although remembering the path to the move that const …