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

Carry save addition and generated and propagate function, Explain carry sav...

Explain carry save addition (CSA) process. Ans: Instead of allowing the carries ripple along the rows, they can be saved and then introduced into the next roe at the right wei

Operation research, how to implement a modified distribution method using c...

how to implement a modified distribution method using c/c++

What are the "field" and "chain" statements, What are the "field" and "chai...

What are the "field" and "chain" Statements? The FIELD and CHAIN flow logic statements let you Program your own checks. FIELD and CHAIN tell the system which fields you are ch

Algorithm to insert a key in b-tree, Algorithm to insert a key in B-tree is...

Algorithm to insert a key in B-tree is as follows: 1.  First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into

History of information technology and organisations, History of Information...

History of Information Technology and Organisations The increasing sophistication in information systems and the growth in their use have been influenced by three main factors

Define the abstraction of OOA, Define the Abstraction of OOA Now, let ...

Define the Abstraction of OOA Now, let us see how objects can be seen as a problem, and find their associated data and their behaviour. You will notice that an object is an ab

Subsequent statements set every element of matrix, Q. Subsequent statements...

Q. Subsequent statements set every element of matrix? Let a= [2,4,6,8,10], b=[1,3,5,7,9], c=[0,0,0,0,0] Consider the subsequent program section FORALL (i = 2:4)   a(i)

Determine a program that is in execution, Determine a program that is in ex...

Determine a program that is in execution is known as Program in execution is known as Process

Problem based on banker''s algorithm, A system contains 10 units of resourc...

A system contains 10 units of resource class Ru. The resource requirements of three user processes P1, P2 and P3 are as follows

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