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

Determine in detail about the vhdl, Determine in detail about the VHDL ...

Determine in detail about the VHDL Multiple design-units (entity/architecture pairs), which reside in the same system file, may be separately compiled if so desired. Though, it

What is modem?, A device, usually linked to a serial port of a computer, th...

A device, usually linked to a serial port of a computer, that transfer data over regular phone lines. Modem stands modulator demodulator; it changes a digital stream of data into s

What is a accepting computation history, What is a accepting computation hi...

What is a accepting computation history?  An accepting computation history is explained as , Let M be a Turing machine and w be a input string,  for M on w is a sequence of con

What are the kernel threads, What are the Kernel threads Kernel threads...

What are the Kernel threads Kernel threads are supported directly by the operating system .Thread creation; scheduling and management are done by the operating system. Thus the

Illustrate internal organisation of ram, Q. Illustrate Internal Organisatio...

Q. Illustrate Internal Organisation of RAM? The construction displayed in Figure below is made up of one JK flip-flop and 3 AND gates. The two inputs to system are one input bi

Difference between blocking and non-blocking, Difference between blocking a...

Difference between blocking and non-blocking Verilog  language  has  two  forms  of  the  procedural  assignment  statement:  blocking  and  nonblocking. The two are distinguis

The function code currently active, The Function code currently active is a...

The Function code currently active is ascertained by what Variable? The function code at present active in  a Program can be ascertained from the SY-UCOMM  Variable.

Explain about cluster computing, The idea of clustering is defined as use o...

The idea of clustering is defined as use of multiple computers naturally multiple storage devices, PCs or UNIX workstations and their interconnections to make what emerges to users

.., consider an open circuit pn junction.sketch curves as a function of dis...

consider an open circuit pn junction.sketch curves as a function of distance across the junction of space charge ,electric field and potential

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