Prolog, Computer Engineering

Assignment Help:

Prolog:

Still we can take our card game from the previous lecture like a case study for the implementation of a logic-based expert system. So there the rules were: four cards are laid on the table face up. Now Player 1 takes the first card, they take it in turns until they both have two cards each. And to see who has won, and they each add up their two card numbers, the winner is the one with the highest even number. So there the winner scores the even number they have. But see if there's no even number, and both players achieve the same even number, so then the game is drawn. Than it could be argued that undertaking a minimax search is a little avoidable for this game, this means that we could easily simplified a set of rules for each player, and so that they choose cards rationally. Just to demonstrate this, there we will derive down some Prolog rules that specify how player one should choose the first card.

For more understand we see example, assume there the cards dealt were as: 4, 5, 6, 10. So now in this case, there the best choice of action for player one is to choose the 10, and followed presumably by the 4, hence player two will pick the 6. After that we need to abstract from this particular example to the general case as: we see such there were three even numbers or one odd one, and according that player one is guaranteed another even number to match the one they chose for match.


Related Discussions:- Prolog

Combinational circuit for sorting the string, Every input line of combinati...

Every input line of combinational circuit represents a specific element of the string let's say xi and every output line results in the form of a sorted list. In order to get the a

Essential features of an algorithm, Necessary features of an algorithm: ...

Necessary features of an algorithm: 1.Input: The algorithm should take zero or more input. 2. Output: The algorithm should generate one or more outputs.  3. Definiteness:

Prove, state and prove distributive law?

state and prove distributive law?

Explain about indirect addressing, Q. Explain about Indirect Addressing? ...

Q. Explain about Indirect Addressing? In this technique the operand field of instruction specifies the address of address of intended operand for example if instruction LOAD

Show independent loops in fortran program, Q. Show Independent loops in for...

Q. Show Independent loops in fortran program? In the subsequent code portion the directives point to the outer two loops are independent. The inner loop allocates elements of A

What is binary search, Binary Search: Search a sorted array by repeatedly i...

Binary Search: Search a sorted array by repeatedly in-between the search interval in half. Start with an interval covering the entire array. If the value of the search key is less

Why stored program control gains superiority over hard wired, In what way i...

In what way is stored program control superior to hard wired control? The SPC gains superiority over hard wired because of following points: SP C Ha

Name various work processes of r/3 system, Name various work processes of R...

Name various work processes of R/3 system? A) Dialog or Online (processes only one request at a time). B) Background (Started at a specific time) C) Update (primary or se

Can matchcode object contain ids with different update types, Can matchcode...

Can matchcode object contain Ids with different update types? Yes.

String, super string checker

super string checker

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd